Competitive generalized auctions

DOI10.1145/509907.509921MaRDI QIDQ3579178zbMATH OpenOpenAlexFDO

Authors Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin, 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

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26)

Cited in

(14)

• Hardness results for multicast cost sharing.
• Setting lower bounds on truthfulness
• Approximation and collusion in multicast cost sharing
• Online learning in online auctions
• A BGP-based mechanism for lowest-cost routing
• The power of fair pricing mechanisms
• Unconditional competitive auctions with copy and budget constraints
• Competitive auctions
• Combinatorial auctions with verification are tractable
• Optimal deterministic auctions with correlated priors
• Optimal impartial selection
• Derandomization of auctions
• Explicitly simple near-tie auctions
• Reducing mechanism design to algorithm design via machine learning

This page was built for publication: Competitive generalized auctions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579178)