On the Approximability of Combinatorial Exchange Problems

DOI10.1007/978-3-540-79309-0_9zbMATH Open1136.91347OpenAlexW1936651236MaRDI QIDQ5459974FDOQ5459974

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

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

Mathematics Subject Classification ID

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

Cites Work

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

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)