Limitations of randomized mechanisms for combinatorial auctions

Shaddin Dughmi and Jan Vondrák

Games and Economic Behavior, 2015, vol. 92, issue C, 370-400

Abstract: We address the following fundamental question in the area of incentive-compatible mechanism design: Are truthful-in-expectation mechanisms compatible with polynomial-time approximation? In particular, can polynomial-time truthful-in-expectation mechanisms achieve a near-optimal approximation ratio for combinatorial auctions with submodular valuations?

Keywords: Algorithmic mechanism design; Combinatorial auctions; Incentive compatibility; Submodular valuations (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 (4)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0899825614000098
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:370-400

DOI: 10.1016/j.geb.2014.01.007

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 ().