Bayesian incentive compatibility via matchings

Jason D. Hartline, Robert Kleinberg and Azarakhsh Malekian

Games and Economic Behavior, 2015, vol. 92, issue C, 401-429

Abstract: Optimally allocating cellphone spectrum, advertisements on the Internet, and landing slots at airports is computationally intractable. When the participants may strategize, not only must the optimizer deal with complex feasibility constraints but also with complex incentive constraints. We give a very simple method for constructing a Bayesian incentive compatible mechanism from any, potentially non-optimal, algorithm that maps agents' reports to an allocation. The expected welfare of the mechanism is, approximately, at least that of the algorithm on the agents' true preferences.

Keywords: Bayesian mechanism design; Algorithmic mechanism design; Incentive compatibility; Multi-dimensional preferences (search for similar items in EconPapers)
JEL-codes: C70 D44 (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0899825615000214
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:gamebe:v:92:y:2015:i:c:p:401-429

DOI: 10.1016/j.geb.2015.02.002

Access Statistics for this article

Games and Economic Behavior is currently edited by E. Kalai

More articles in Games and Economic Behavior from Elsevier
Bibliographic data for series maintained by Catherine Liu ().