Mechanisms for multi-unit auctions

Shahar Dobzinski*, Noam Nisan

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

40 Scopus citations


We present an incentive-compatible polynomial-time approximation scheme for multi-unit auctions with general k-minded player valuations. The mechanism fully optimizes over an appropriately chosen sub-range of possible allocations and then uses VCG payments over this sub-range. We show that obtaining a fully polynomial-time incentive-compatible approximation scheme, at least using VCG payments, is NP-hard. For the case of valuations given by black boxes, we give a polynomial-time incentive-compatible 2-approximation mechanism and show that no better is possible, at least using VCG payments.

Original languageAmerican English
Pages (from-to)85-98
Number of pages14
JournalJournal of Artificial Intelligence Research
StatePublished - Jan 2010


Dive into the research topics of 'Mechanisms for multi-unit auctions'. Together they form a unique fingerprint.

Cite this