Approximation of Walrasian equilibrium in single-minded auctions
DOI10.1016/J.TCS.2005.03.008zbMATH Open1068.91017OpenAlexW2053852034MaRDI QIDQ557845FDOQ557845
Authors: Li-Sha Huang, Minming Li, Bo Zhang
Publication date: 30 June 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.03.008
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Voting theory (91B12) Special types of economic equilibria (91B52)
Cites Work
- Competitive equilibrium in an exchange economy with indivisibilities
- Walrasian equilibrium with gross substitutes
- Combinatorial auctions: a survey
- Job Matching, Coalition Formation, and Gross Substitutes
- Title not available (Why is that?)
- On the complexity of price equilibria
- On complexity of single-minded auction
- Majority equilibrium for public facility allocation (preliminary version)
- Approximate Walrasian Equilibria and Nearby Economies
Cited In (4)
This page was built for publication: Approximation of Walrasian equilibrium in single-minded auctions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557845)