Center for Algorithms and Theory of Computation

CS 269S, Winter 2019: Theory Seminar
Bren Hall, Room 1423, 1pm


March 1, 2019:

Simple and Nearly Optimal Mutli-item Auctions

Speaker: Ceasar Aguma

I will introduce multi-unit auction problem model and hopefully show how said problem can be solved in polynomial time with an auction mechanism that gives nearly optimal revenue for cases where the number of bidders are either constant or large and i.i.d.

Based on the the 2013 SODA paper, "Simple and Nearly Optimal Mutli-item Auctions" by Caio and Huang.