Home /  Workshop /  Schedules /  Dual Reduction and Elementary Games with Senders and Receivers

Dual Reduction and Elementary Games with Senders and Receivers

Algorithms, Approximation, and Learning in Market and Mechanism Design November 06, 2023 - November 09, 2023

November 08, 2023 (09:00 AM PST - 09:45 AM PST)
Speaker(s): Roger Myerson (University of Chicago)
Location: SLMath: Eisenbud Auditorium, Online/Virtual
Primary Mathematics Subject Classification No Primary AMS MSC
Secondary Mathematics Subject Classification No Secondary AMS MSC
Video

Dual Reduction and Elementary Games with Senders and Receivers

Abstract

Consider the incentive constraints that define the incentive-compatible mechanisms of a senders-receivers game.  Duals of these linear constraints form Markov chains on the senders' type sets and the receivers' action sets.  The minimal nonempty absorbing sets of these Markov chains can be interpreted as the types and actions in a dual-reduced game.  Any incentive-compatible mechanism of a dual-reduced game induces an equivalent incentive compatible mechanism for the original game.  We say that a game is elementary if all nontrivial incentive constraints can be satisfied as strict inequalities in incentive-compatible mechanisms.  Any senders-receivers game can be reduced to an elementary game by iterative dual reduction.

Supplements
Asset no preview Slides 481 KB application/pdf Download
Video/Audio Files

Dual Reduction and Elementary Games with Senders and Receivers

Troubles with video?

Please report video problems to itsupport@slmath.org.

See more of our Streaming videos on our main VMath Videos page.