Derandomization of auctions

DOI10.1145/1060590.1060682zbMath1192.91095OpenAlexW2080463870MaRDI QIDQ5901102

Amos Fiat, Jason D. Hartline, Gagan Aggarwal, Nicole Immorlica, Madhu Sudan, Andrew V. Goldberg

Publication date: 16 August 2010

Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/99342

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items (12)

Worst-case optimal redistribution of VCG payments in multi-unit auctions ⋮ A Numbers-on-Foreheads Game ⋮ Bears with hats and independence polynomials ⋮ Hat guessing numbers of degenerate graphs ⋮ A tree formulation for signaling games ⋮ Better redistribution with inefficient allocation in multi-unit auctions ⋮ Derandomization of auctions ⋮ Competitive auctions ⋮ Optimal VCG mechanisms to assign multiple bads ⋮ On 1-factorizations of bipartite Kneser graphs ⋮ Hat guessing on books and windmills ⋮ The hat guessing number of graphs

This page was built for publication: Derandomization of auctions