Impossibility Results for Truthful Combinatorial Auctions with Submodular Valuations
From MaRDI portal
Publication:3177762
DOI10.1145/2786754zbMATH Open1426.68119OpenAlexW2333413293MaRDI QIDQ3177762FDOQ3177762
Authors: Shahar Dobzinski, Jan Vondrák 
Publication date: 2 August 2018
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2786754
Recommendations
- An impossibility result for truthful combinatorial auctions with submodular valuations
- Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders
- Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders
- Truthfulness with value-maximizing bidders: on the limits of approximation in combinatorial markets
- Inapproximability results for combinatorial auctions with submodular utility functions
- Truthful approximation mechanisms for restricted combinatorial auctions
- On the limitations of greedy mechanism design for truthful combinatorial auctions
- Truth revelation in approximately efficient combinatorial auctions
- Truthful randomized mechanisms for combinatorial auctions
- Truthful randomized mechanisms for combinatorial auctions
Analysis of algorithms and problem complexity (68Q25) Auctions, bargaining, bidding and selling, and other market models (91B26)
Cited In (6)
- Inapproximability results for combinatorial auctions with submodular utility functions
- Best-response dynamics in combinatorial auctions with item bidding
- Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders
- Setting lower bounds on truthfulness
- Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions
- Truthful mechanism design via correlated tree rounding
This page was built for publication: Impossibility Results for Truthful Combinatorial Auctions with Submodular Valuations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177762)
