On the Approximability of Combinatorial Exchange Problems
From MaRDI portal
Publication:5459974
DOI10.1007/978-3-540-79309-0_9zbMath1136.91347OpenAlexW1936651236MaRDI QIDQ5459974
Moshe Babaioff, Patrick Briest, Piotr Krysta
Publication date: 2 May 2008
Published in: Algorithmic Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-79309-0_9
Inventory, storage, reservoirs (90B05) Auctions, bargaining, bidding and selling, and other market models (91B26) Combinatorial games (91A46)
Related Items
Cites Work
- Efficient mechanisms for bilateral trading
- The communication requirements of efficient allocations and supporting prices
- New trade-offs in cost-sharing mechanisms
- Algorithmic construction of sets for k -restrictions
- Truth revelation in approximately efficient combinatorial auctions
- Approximation techniques for utilitarian mechanism design
- Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
- Algorithm for optimal winner determination in combinatorial auctions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item