On the complexity of the parity argument and other inefficient proofs of existence
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
A two-dimensional bisection envelope algorithm for fixed points
Journal of Complexity
On Computation of Arbitrage for Markets with Friction
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Playing large games using simple strategies
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)
A recursive algorithm for the infinity-norm fixed point problem
Journal of Complexity
On algorithms for discrete and approximate brouwer fixed points
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Algorithm 848: A recursive fixed-point algorithm for the infinity-norm case
ACM Transactions on Mathematical Software (TOMS)
The complexity of computing a Nash equilibrium
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
A note on two fixed point problems
Journal of Complexity
Matching algorithmic bounds for finding a Brouwer fixed point
Journal of the ACM (JACM)
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
Computational Aspects of Equilibria
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Optimal bounds on finding fixed points of contraction mappings
Theoretical Computer Science
On the Complexity of Nash Equilibria and Other Fixed Points
SIAM Journal on Computing
Discrete Fixed Points: Models, Complexities, and Applications
Mathematics of Operations Research
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
Recent developments in equilibria algorithms
WINE'05 Proceedings of the First international conference on Internet and Network Economics
A fixed point approach for the computation of market equilibria
WINE'05 Proceedings of the First international conference on Internet and Network Economics
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
Survey: Nash equilibria: Complexity, symmetries, and approximation
Computer Science Review
The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson Solutions
ACM Transactions on Economics and Computation - Special Issue on Algorithmic Game Theory
| Hi-index | 0.00 |