Understanding Incentives: Mechanism Design Becomes Algorithm Design
We provide a computationally efficient black-box reduction from mechanism design to algorithm design in very general settings. Specifically, we give an approximation-preserving reduction from truthfully maximizing any objective under arbitrary feasibility constraints with arbitrary bidder types to (...
Main Authors: | Cai, Yang, Daskalakis, Konstantinos, Weinberg, Seth Matthew |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2015
|
Online Access: | http://hdl.handle.net/1721.1/99969 https://orcid.org/0000-0002-5451-0490 |
Similar Items
-
On Optimal Multi-Dimensional Mechanism Design
by: Weinberg, Seth Matthew, et al.
Published: (2015) -
Optimal Multi-dimensional Mechanism Design: Reducing Revenue to Welfare Maximization
by: Cai, Yang, et al.
Published: (2015) -
An algorithmic characterization of multi-dimensional mechanisms
by: Cai, Yang, et al.
Published: (2015) -
Bayesian Truthful Mechanisms for Job Scheduling from Bi-criterion Approximation Algorithms
by: Daskalakis, Konstantinos, et al.
Published: (2015) -
Reducing Revenue to Welfare Maximization: Approximation Algorithms and Other Generalizations
by: Cai, Yang, et al.
Published: (2015)