Book chapter
Computing Equilibrium Prices: Does Theory Meet Practice?
Algorithms – ESA 2005, pp.83-94
Lecture Notes in Computer Science, Springer Berlin Heidelberg
2005
DOI: 10.1007/11561071_10
Abstract
The best known algorithms for the computation of market equilibria, in a general setting, are not guaranteed to run in polynomial time. On the other hand, simple poly-time algorithms are available for various restricted – yet important – markets.
In this paper, we experimentally explore the gray zone between the general problem and the poly-time solvable special cases. More precisely, we analyze the performance of some simple algorithms, for inputs which are relevant in practice, and where the theory does not provide poly-time guarantees.
Details
- Title: Subtitle
- Computing Equilibrium Prices: Does Theory Meet Practice?
- Creators
- Bruno Codenotti - Toyota Technological Institute at ChicagoBenton McCune - University of IowaRajiv Raman - University of IowaKasturi Varadarajan - University of Iowa
- Resource Type
- Book chapter
- Publication Details
- Algorithms – ESA 2005, pp.83-94
- Publisher
- Springer Berlin Heidelberg; Berlin, Heidelberg
- Series
- Lecture Notes in Computer Science
- DOI
- 10.1007/11561071_10
- eISSN
- 1611-3349
- ISSN
- 0302-9743
- Language
- English
- Date published
- 2005
- Academic Unit
- Computer Science
- Record Identifier
- 9984259414102771
Metrics
43 Record Views