Abstracts

Most events on this list can be tied to a specific page somewhere on the internet.  List entries contain links to such pages through the "Details".   Occasionally events have no such page or the information on it is inadequate.  In such cases I attempt to cobble together a details page myself.



Amin Rahimian will be presenting at ML Tea next Monday (5/15; talk details below).
Title: Bayesian Group Decisions: Algorithms and Complexity
Date: Monday, May 15 2017
Time: 4:30 to 5:00 PM
Location: G4 lounge (32-G475)

Abstract

Many important real-world decision-making problems involve group interactions among individuals with purely informational externalities. Such situations arise for example in jury deliberations, expert committees, medical diagnoses, etc.

We model the purely informational interactions of rational agents in a group, where they receive private information and act based on that information while also observing other people's beliefs or actions. As a Bayesian agent attempts to infer the true state of the world from her sequence of observations of actions of others as well as her own private signal, she recursively refines her belief on the signals that other players could have observed and actions that they could have taken given the assumption that other players are also rational. The existing literature addresses asymptotic and equilibrium properties of Bayesian group decisions and important questions such as convergence to consensus and learning.

In this work, we address the computations that the Bayesian agent should undertake to realize the optimal actions at every decision epoch. We use the iterated eliminations of infeasible signals (IEIS) to model the thinking process as well as the calculations of a Bayesian agent in a group decision scenario. We show that IEIS algorithm runs in exponential time; however, when the group structure is a partially ordered set the Bayesian calculations simplify and polynomial-time computation of the Bayesian recommendations is possible. We next shift attention to the case where agents reveal their beliefs (instead of actions) at every decision epoch. We analyze the computational complexity of the Bayesian belief formation in groups and show that it is NP- hard. We also investigate the factors underlying this computational complexity and show how belief calculations simplify in special network structures or cases with strong inherent symmetries. We finally give insights about the statistical efficiency (optimality) of the beliefs and its relations to computational efficiency.

Joint work with Tailin Wu, Isaac Chuang