On simultaneous two-player combinatorial auctions

MaRDI QIDQ4608040zbMATH OpenFDO

Authors Mark Braverman, Jieming Mao, S. Matthew Weinberg

Publication date 15 March 2018

Full work available at URL https://arxiv.org/abs/1704.03547, http://dl.acm.org/citation.cfm?id=3175451

zbMATH Keywords

allocation problemcombinatorial auctionsdecision problemtwo-player auctions

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04) 2-person games (91A05) Combinatorial games (91A46) Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

• Separating the communication complexity of truthful and nontruthful algorithms for combinatorial auctions
• Communication complexity of combinatorial auctions with submodular valuations
• On the complexity of computing an equilibrium in combinatorial auctions
• Approximation algorithms for combinatorial auctions with complement-free bidders
• Simultaneous auctions are (almost) efficient

Cited in

(8)

• Economic efficiency requires interaction
• Market Equilibrium for Combinatorial Auctions and the Matching Core of Nonnegative TU Games
• scientific article; zbMATH DE number 5788419 (Why is no real title available?)
• On the Economic Efficiency of the Combinatorial Clock Auction
• Separating the communication complexity of truthful and nontruthful algorithms for combinatorial auctions
• Note on an Auction Procedure for a Matching Game in Polynomial Time
• Algorithms - ESA 2003
• Improved truthful mechanisms for combinatorial auctions with submodular bidders

This page was built for publication: On simultaneous two-player combinatorial auctions

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