On the Approximation and Smoothed Complexity of Leontief Market Equilibria
Authors:
- 1 September 2007
- book chapter
- Published by Springer Nature
- p. 96-107
Abstract
No abstract availableKeywords
All Related Versions
This publication has 12 references indexed in Scilit:
- The complexity of computing a Nash equilibrium2006
- Leontief economies encode nonzero sum two-player games2006
- Settling the Complexity of Two-Player Nash Equilibrium2006
- Computing Nash Equilibria: Approximation and Smoothed Complexity2006
- Smoothed analysis of algorithmsJournal of the ACM, 2004
- On the complexity of price equilibriaJournal of Computer and System Sciences, 2003
- Playing large games using simple strategies2003
- On the complexity of the parity argument and other inefficient proofs of existenceJournal of Computer and System Sciences, 1994
- Equilibrium Points of Bimatrix GamesJournal of the Society for Industrial and Applied Mathematics, 1964
- Non-Cooperative GamesAnnals of Mathematics, 1951