November 29:  Toygar Kerman  (QSMS Seminar)

Toygar Kerman (Corvinus University) will be presenting his paper “Persuading Communicating Voters (co-authored with Anastas P. Tenev)) on November 29th at 10 AM, room QA 3rd floor conference roomn. One-to-one meetings with the speaker can be arranged; please contact the seminar organizers, Dr. Noémie Cabau (cabau.noemie@gtk.bme.hu) and Dr. Arseniy Samsonov (samsonov.arseniy@gtk.bme.hu).  

Abstract:  We study a multiple-receiver Bayesian persuasion model in which the sender wants to implement a proposal and commits to a signal which sends correlated messages to multiple receivers who have homogeneous beliefs. Receivers are connected in a network and can perfectly observe their direct neighbors’ messages. After updating their beliefs, receivers vote for or against the proposal. The setup with limited information spillovers creates a significant complication in designing optimal signals. We simplify the sender’s problem by providing partial characterizations for optimal communication and consider applications which are characterized by distinct patterns of voter interaction. We show that the sender can achieve the upper bound of the value (i.e. the case with no spillovers) in most of the applications. Surprisingly, more communication among the receivers can even be strictly better for the sender and hence strictly worse for the voters. 

November 22:  Robert Schmidt  (QSMS Seminar)

 Robert Schmidt (University of Hagen) will be presenting his paper “On the timing of moves in two-player games (co-authored with Leanne Streekstra, Larry Karp, and Leo Simon) on November 22nd at 10 AM, room QA405. One-to-one meetings with the speaker can be arranged; please contact the seminar organizers, Dr. Noémie Cabau (cabau.noemie@gtk.bme.hu) and Dr. Arseniy Samsonov (samsonov.arseniy@gtk.bme.hu).  

Abstract:  We analyze two-player games in continuous time in which each player is free to decide when to move and what action to implement. The number of moves per player is restricted to (at most) one. We arrive at sharp predictions about the equilibrium outcome in certain classes of games, for which we can predict the timing of players’ moves, as well as the identity of the leader in a unique equilibrium outcome with sequential moves. This includes games with a second-mover advantage and non-trivial action sets that are traditionally analyzed in static settings. We illustrate the strength of our general modeling framework by applying it to canonical games from industrial economics and political economics such as price competition, and electoral competition where candidates differ in their “valence”.