The Complexity of Optimal Mechanism Design
Myerson's seminal work provides a computationally efficient revenue-optimal auction for selling one item to multiple bidders [18]. Generalizing this work to selling multiple items at once has been a central question in economics and algorithmic game theory, but its complexity has remained poorl...
Main Authors: | Deckelbaum, Alan, Tzamos, Christos, Daskalakis, Konstantinos |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Society for Industrial and Applied Mathematics
2015
|
Online Access: | http://hdl.handle.net/1721.1/99968 https://orcid.org/0000-0002-7560-5069 https://orcid.org/0000-0002-5451-0490 |
Similar Items
-
Mechanism Design via Optimal Transport
by: Daskalakis, Konstantinos, et al.
Published: (2015) -
Optimal Pricing Is Hard
by: Deckelbaum, Alan, et al.
Published: (2015) -
Strong Duality for a Multiple-Good Monopolist
by: Deckelbaum, Alan T, et al.
Published: (2017) -
The complexity of optimal mechanism design
by: Tzamos, Christos
Published: (2013) -
Strong Duality for a Multiple-Good Monopolist
by: Daskalakis, Constantinos, et al.
Published: (2019)