Caltech Logo

Ulric B. and Evelyn L. Bray Social Sciences Seminar

Wednesday, September 2, 2020
12:00pm to 1:00pm
Add to Cal
Online Event
A Strong Minimax Theorem for Informationally-Robust Auction Design
Ben Brooks, Assistant Professor, Department of Economics, University of Chicago,

Abstract: We study the design of profit-maximizing mechanisms in environments with interdependent values. A single unit of a good is for sale. There is a known joint distribution of the bidders' ex post values for the good. Two programs are considered:
(i) Maximize over mechanisms the minimum over information structures and equilibria of expected profit;
(ii) Minimize over information structures the maximum over mechanisms and equilibria of expected profit.
These programs are shown to have the same optimal value, which we term the profit guarantee.
In addition, we characterize a family of linear programs that relax (i) and produce, for any finite number of actions, a mechanism with a corresponding lower bound on equilibrium profit. An analogous family of linear programs that relax (ii) produce, for any finite number of signals, an information structure with a corresponding upper bound on equilibrium profit. These lower and upper bounds converge to the profit guarantee as the numbers of actions and signals grow large. Our model can be extended to allow for demand constraints, multiple goods, and ambiguity about the value distribution. We report numerical simulations of approximate solutions to (i) and (ii).

Written with Songzi Du. Professor Brooks will be joined by guests Nima Haghpanah, Philipp Strack and Scott Komminers.

How to view the seminar:
Sign up for a free twitch.tv account, and tune in on Wednesdays at noon pacific time on twitch.tv/caltechecontheory. You will be able to ask questions on the twitch chat.

For more information, please contact Letty Diaz by phone at 626-395-1255 or by email at letty.diaz@caltech.edu.