On the Approximability of Combinatorial Exchange Problems

DOI10.1007/978-3-540-79309-0_9MaRDI QIDQ5459974zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Combinatorial games (91A46) Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

• On the complexity of price equilibria
• Package Auctions and Exchanges
• Combinatorial Walrasian equilibrium
• Combinatorial Walrasian equilibrium
• Algorithms for Pareto optimal exchange with bounded exchange cycles

Cites work

• Algorithm for optimal winner determination in combinatorial auctions
• Algorithmic construction of sets for k -restrictions
• Approximation techniques for utilitarian mechanism design
• Combinatorial auctions. Foreword by Vernon L. Smith.
• Efficient mechanisms for bilateral trading
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1102774 (Why is no real title available?)
• scientific article; zbMATH DE number 2086678 (Why is no real title available?)
• New trade-offs in cost-sharing mechanisms
• Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
• The communication requirements of efficient allocations and supporting prices
• Truth revelation in approximately efficient combinatorial auctions

Cited in

(4)

• On the theoretical properties of the exchange algorithm
• Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
• On Finite Dimension Exchange Algorithms
• Combinatorial reallocation mechanisms

This page was built for publication: On the Approximability of Combinatorial Exchange Problems

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