The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
On the Approximation and Smoothed Complexity of Leontief Market Equilibria
[article]
2006
arXiv
pre-print
We show that the problem of finding an \epsilon-approximate Nash equilibrium of an n by n two-person games can be reduced to the computation of an (\epsilon/n)^2-approximate market equilibrium of a Leontief economy. Together with a recent result of Chen, Deng and Teng, this polynomial reduction implies that the Leontief market exchange problem does not have a fully polynomial-time approximation scheme, that is, there is no algorithm that can compute an \epsilon-approximate market equilibrium in
arXiv:cs/0602090v1
fatcat:3ghfwx53lnhilmsqv5rl7mqkha