2 search results - page 1 / 1 » Worst-case efficiency ratio in false-name-proof combinatoria... |
ATAL
2010
Springer
13 years 6 months ago
2010
Springer
This paper analyzes the worst-case efficiency ratio of falsename-proof combinatorial auction mechanisms. False-nameproofness generalizes strategy-proofness by assuming that a bidd...
ATAL
2010
Springer
13 years 6 months ago
2010
Springer
We study a more powerful variant of false-name manipulation in Internet auctions: an agent can submit multiple false-name bids, but then, once the allocation and payments have bee...