Journal of Complexity
Exponential lower bounds for finding Brouwer fixed points
Journal of Complexity
An ellipsoid algorithm for the computation of fixed points
Journal of Complexity - Festschrift for Joseph F. Traub, Part 1
Computational complexity of fixed points and intersection points
Journal of Complexity
Approximating fixed points of weakly contracting mappings
Journal of Complexity
Iterative solution of nonlinear equations in several variables
Iterative solution of nonlinear equations in several variables
On the complexity of equilibria
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A two-dimensional bisection envelope algorithm for fixed points
Journal of Complexity
Market Equilibrium via a Primal-Dual-Type Algorithm
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Profit-maximizing multicast pricing by approximating fixed points [Extended Abstract]
Proceedings of the 4th ACM conference on Electronic commerce
Pricing network edges for heterogeneous selfish users
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Algorithm 825: A deep-cut bisection envelope algorithm for fixed points
ACM Transactions on Mathematical Software (TOMS)
Spectral partitioning works: planar graphs and finite element meshes
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
A duality model of TCP and queue management algorithms
IEEE/ACM Transactions on Networking (TON)
On the complexity of price equilibria
Journal of Computer and System Sciences - STOC 2002
A recursive algorithm for the infinity-norm fixed point problem
Journal of Complexity
The spending constraint model for market equilibrium: algorithmic, existence and uniqueness results
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A Polynomial Time Algorithm for Computing the Arrow-Debreu Market Equilibrium for Linear Utilities
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Market equilibria for homothetic, quasi-concave utilities and economies of scale in production
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A note on two fixed point problems
Journal of Complexity
Quantum Separation of Local Search and Fixed Point Computation
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Settling the complexity of computing two-player Nash equilibria
Journal of the ACM (JACM)
On the complexity of 2D discrete fixed point problem
Theoretical Computer Science
Direction Preserving Zero Point Computing and Applications
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Optimal bounds on finding fixed points of contraction mappings
Theoretical Computer Science
Making economic theory operational
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Lattice embedding of direction-preserving correspondence over integrally convex set
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
A simplicial approach for discrete fixed point theorems
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
On the complexity of 2d discrete fixed point problem
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Survey: Equilibria, fixed points, and complexity classes
Computer Science Review
Hi-index | 0.00 |
We study the algorithmic complexity of the discrete fixed point problem and develop an asymptotic matching bound for a cube in any constantly bounded finite dimension. To obtain our upper bound, we derive a new fixed point theorem, based on a novel characterization of boundary conditions for the existence of fixed points.In addition, exploring a linkage with the approximation problem of the continuous fixed point problem, we obtain asymptotic matching bounds for complexity of the approximate Brouwer fixed point problem in the continuous case for Lipschitz functions that close a previous exponential gap. It settles a fifteen years old open problem of Hirsch, Papadimitriou and Vavasis by improving both the upper and lower bounds.Our new characterization for existence of a fixed point is also applicable to functions defined on non-convex domain and makes it a potentially useful tool for design and analysis of algorithms for fixed points in general domain.