TY - JOUR
T1 - Non-optimal mechanism design
AU - Hartline, Jason D
AU - Lucier, Brendan
PY - 2015/10/1
Y1 - 2015/10/1
N2 - The optimal allocation of resources in complex environments-like allocation of dynamic wireless spectrum, cloud computing services, and Internet advertising-is computationally challenging even given the true preferences of the participants. In the theory and practice of optimization in complex environments, a wide variety of special and general purpose algorithms have been developed; these algorithms produce outcomes that are satisfactory but not generally optimal or incentive compatible. This paper develops a very simple approach for converting any, potentially non-optimal, algorithm for optimization given the true participant preferences, into a Bayesian incentive compatible mechanism that weakly improves social welfare and revenue.
AB - The optimal allocation of resources in complex environments-like allocation of dynamic wireless spectrum, cloud computing services, and Internet advertising-is computationally challenging even given the true preferences of the participants. In the theory and practice of optimization in complex environments, a wide variety of special and general purpose algorithms have been developed; these algorithms produce outcomes that are satisfactory but not generally optimal or incentive compatible. This paper develops a very simple approach for converting any, potentially non-optimal, algorithm for optimization given the true participant preferences, into a Bayesian incentive compatible mechanism that weakly improves social welfare and revenue.
UR - http://www.scopus.com/inward/record.url?scp=84944096659&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84944096659&partnerID=8YFLogxK
U2 - 10.1257/aer.20130712
DO - 10.1257/aer.20130712
M3 - Article
AN - SCOPUS:84944096659
SN - 0002-8282
VL - 105
SP - 3102
EP - 3124
JO - American Economic Review
JF - American Economic Review
IS - 10
ER -