Combinatorial Auctions with Conflict-Based Externalities
From MaRDI portal
Publication:3460791
DOI10.1007/978-3-662-48995-6_17zbMath1406.91164arXiv1509.09147OpenAlexW2263506547MaRDI QIDQ3460791
Yun Kuen Cheung, Martin Starnberger, Martin Hoefer, Monika R. Henzinger
Publication date: 8 January 2016
Published in: Web and Internet Economics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.09147
Applications of graph theory (05C90) Auctions, bargaining, bidding and selling, and other market models (91B26) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Computing optimal outcomes under an expressive representation of settings with externalities
- Multidimensional mechanism design for auctions with externalities
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- The communication requirements of efficient allocations and supporting prices
- Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
- Combinatorial Auctions with Conflict-Based Externalities
- Pairwise Independence and Derandomization
- Approximations of Weighted Independent Set and Hereditary Subset Problems
- Approximation resistance from pairwise independent subgroups
- Truthful randomized mechanisms for combinatorial auctions
This page was built for publication: Combinatorial Auctions with Conflict-Based Externalities