Competitive generalized auctions
From MaRDI portal
Publication:3579178
DOI10.1145/509907.509921zbMath1192.91103OpenAlexW2047031390MaRDI QIDQ3579178
Anna R. Karlin, Andrew V. Goldberg, Jason D. Hartline, Amos Fiat
Publication date: 5 August 2010
Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/509907.509921
Related Items
Approximation and collusion in multicast cost sharing ⋮ Online learning in online auctions ⋮ Optimal Impartial Selection ⋮ Setting lower bounds on truthfulness ⋮ Hardness results for multicast cost sharing. ⋮ Explicitly simple near-tie auctions ⋮ The power of fair pricing mechanisms ⋮ A BGP-based mechanism for lowest-cost routing ⋮ Derandomization of auctions ⋮ Reducing mechanism design to algorithm design via machine learning ⋮ Unconditional competitive auctions with copy and budget constraints ⋮ Competitive auctions ⋮ Combinatorial auctions with verification are tractable ⋮ Optimal deterministic auctions with correlated priors