On algorithms for discrete and approximate brouwer fixed points

DOI10.1145/1060590.1060638zbMath1192.68351OpenAlexW2006609731MaRDI QIDQ3581431

Xi Chen, Xiaotie Deng

Publication date: 16 August 2010

Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1060590.1060638

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General equilibrium theory (91B50)

Related Items (10)

On the quantum query complexity of local search in two and three dimensions ⋮ Quantum separation of local search and fixed point computation ⋮ Unique end of potential line ⋮ Equilibria, fixed points, and complexity classes ⋮ A note on two fixed point problems ⋮ Circumscribed ellipsoid algorithm for fixed-point problems ⋮ Optimal bounds on finding fixed points of contraction mappings ⋮ A simplicial approach for discrete fixed point theorems ⋮ Unique End of Potential Line ⋮ On the complexity of 2D discrete fixed point problem

Uses Software

• BEDFix

This page was built for publication: On algorithms for discrete and approximate brouwer fixed points