Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Exponential lower bounds for finding Brouwer fixed points
Journal of Complexity
On the complexity of local search
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A parallel algorithmic version of the Local Lemma
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
On Relativization and the Existence of Complete Sets
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Structure in locally optimal solutions
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
On graph-theoretic lemmata and complexity classes
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
The quasilinear isomorphism challenge
ACM SIGACT News
The relative complexity of NP search problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On the complexity of equilibria
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Efficient approximation algorithms for the subset-sums equality problem
Journal of Computer and System Sciences
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Playing large games using simple strategies
Proceedings of the 4th ACM conference on Electronic commerce
Pure Nash equilibria: hard and easy games
Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
Information and Computation
On the complexity of price equilibria
Journal of Computer and System Sciences - STOC 2002
The MarCon algorithm: A systematic market approach to distributed constraint problems
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Auction algorithms for market equilibrium
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The computation of market equilibria
ACM SIGACT News
Hierarchies for semantic classes
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On the computational complexity of Nash equilibria for (0, 1) bimatrix games
Information Processing Letters
Nash Equilibria in Random Games
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Two-player nonzero-sum ω-regular games
CONCUR 2005 - Concurrency Theory
Leontief economies encode nonzero sum two-player games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Reducibility among equilibrium problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The complexity of computing a Nash equilibrium
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Nash equilibria in graphical games on trees revisited
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Playing games in many possible worlds
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Proceedings of the 41st annual Design Automation Conference
Polynomial-size Frege and resolution proofs of st-connectivity and Hex tautologies
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Auction Algorithms for Market Equilibrium
Mathematics of Operations Research
The NP-completeness column: Finding needles in haystacks
ACM Transactions on Algorithms (TALG)
Congestion games with malicious players
Proceedings of the 8th ACM conference on Electronic commerce
A Generic Time Hierarchy with One Bit of Advice
Computational Complexity
Efficient computation of nash equilibria for very sparse win-lose bimatrix games
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Computer science and game theory
Communications of the ACM - Designing games with a purpose
The complexity of uniform Nash equilibria and related regular subgraph problems
Theoretical Computer Science
An experimental study of different approaches to solve the market equilibrium problem
Journal of Experimental Algorithmics (JEA)
The Strategic Exploitation of Limited Information and Opportunity in Networked Markets
Computational Economics
Market equilibrium via a primal--dual algorithm for a convex program
Journal of the ACM (JACM)
Complexity of Verifying Game Equilibria
CEEMAS '07 Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V
A CSP-Based Approach for Solving Parity Game
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
The computation of approximate competitive equilibrium is PPAD-hard
Information Processing Letters
Note: On the complexity of deciding bimatrix games similarity
Theoretical Computer Science
The complexity of equilibria: Hardness results for economies via a correspondence with games
Theoretical Computer Science
The complexity of computing a Nash equilibrium
Communications of the ACM - Inspiring Women in Computing
Approximate Equilibria for Strategic Two Person Games
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Strategic Characterization of the Index of an Equilibrium
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
On the complexity of Nash equilibria of action-graph games
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Algorithms for Solving Infinite Games
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Paintshop, odd cycles and necklace splitting
Discrete Applied Mathematics
Settling the complexity of computing two-player Nash equilibria
Journal of the ACM (JACM)
Polynomial algorithms for approximating Nash equilibria of bimatrix games
Theoretical Computer Science
The structure and complexity of Nash equilibria for a selfish routing game
Theoretical Computer Science
Towards a Study of Low-Complexity Graphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
On the complexity of constrained Nash equilibria in graphical games
Theoretical Computer Science
On the complexity of 2D discrete fixed point problem
Theoretical Computer Science
Pure Nash equilibria: hard and easy games
Journal of Artificial Intelligence Research
Complexity of pure equilibria in Bayesian games
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Computational Aspects of Equilibria
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Nash Dynamics in Constant Player and Bounded Jump Congestion Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Direction Preserving Zero Point Computing and Applications
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
On the computational complexity of Nash equilibria for (0,1) bimatrix games
Information Processing Letters
On the complexity of variations of equal sum subsets
Nordic Journal of Computing
On the approximation and smoothed complexity of Leontief market equilibria
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
A PSPACE-complete Sperner triangle game
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Communications of the ACM
Compactly representing utility functions using weighted goals and the max aggregator
Artificial Intelligence
Local search: simple, successful, but sometimes sluggish
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Computational game theory: an introduction
Algorithms and theory of computation handbook
From feasible proofs to feasible computations
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
When the players are not expectation maximizers
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
A direct reduction from k-player to 2-player approximate nash equilibrium
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Practical and efficient approximations of nash equilibria for win-lose games based on graph spectra
WINE'10 Proceedings of the 6th international conference on Internet and network economics
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
ACM Transactions on Computation Theory (TOCT)
On the Complexity of Nash Equilibria and Other Fixed Points
SIAM Journal on Computing
Archive for Mathematical Logic
Market equilibrium under separable, piecewise-linear, concave utilities
Journal of the ACM (JACM)
Economies with non-convex production and complexity equilibria
Proceedings of the 12th ACM conference on Electronic commerce
Rank-1 bimatrix games: a homeomorphism and a polynomial time algorithm
Proceedings of the forty-third annual ACM symposium on Theory of computing
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Inapproximability of NP-complete variants of nash equilibrium
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Complexity of rational and irrational Nash equilibria
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Discrete Fixed Points: Models, Complexities, and Applications
Mathematics of Operations Research
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
On the complexity of the sperner lemma
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
The complexity of games on highly regular graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Computing equilibrium prices: does theory meet practice?
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Nash equilibrium for upward-closed objectives
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Recent developments in equilibria algorithms
WINE'05 Proceedings of the First international conference on Internet and Network Economics
New results on the complexity of uniformly mixed nash equilibria
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On the complexity of approximating a Nash equilibrium
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Market equilibrium for CES exchange economies: existence, multiplicity, and computation
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Locally 2-dimensional sperner problems complete for the polynomial parity argument classes
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
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
The game world is flat: the complexity of nash equilibria in succinct games
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
On the complexity of uniformly mixed nash equilibria and related regular subgraph problems
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
On the black-box complexity of sperner's lemma
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Computing solutions of the paintshop-necklace problem
Computers and Operations Research
A complementary pivot algorithm for markets under separable, piecewise-linear concave utilities
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Cache me if you can: capacitated selfish replication games
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Approximating Tverberg points in linear time for any fixed dimension
Proceedings of the twenty-eighth annual symposium on Computational geometry
Recent development in computational complexity characterization of Nash equilibrium
Computer Science Review
Survey: A glimpse at Christos H. Papadimitriou
Computer Science Review
Survey: Equilibria, fixed points, and complexity classes
Computer Science Review
Survey: Nash equilibria: Complexity, symmetries, and approximation
Computer Science Review
Nash equilibrium for collective strategic reasoning
Expert Systems with Applications: An International Journal
Multi-valued functions in computability theory
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Efficient algorithms for constant well supported approximate equilibria in bimatrix games
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
The complexity of decision problems about nash equilibria in win-lose games
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Algorithmic Solutions for Envy-Free Cake Cutting
Operations Research
The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson Solutions
ACM Transactions on Economics and Computation - Special Issue on Algorithmic Game Theory
On the Complexity of Approximating a Nash Equilibrium
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
The complexity of non-monotone markets
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Exponentiality of the exchange algorithm for finding another room-partitioning
Discrete Applied Mathematics
Complexity of Rational and Irrational Nash Equilibria
Theory of Computing Systems
Hi-index | 0.02 |
We define several new complexity classes of search problems, ''between'' the classes FP and FNP. These new classes are contained, along with factoring, and the class PLS, in the class TFNP of search problems in FNP that always have a witness. A problem in each of these new classes is defined in terms of an implicitly given, exponentially large graph. The existence of the solution sought is established via a simple graph-theoretic argument with an inefficiently constructive proof; for example, PLS can be thought of as corresponding to the lemma ''every dag has a sink.'' The new classes, are based on lemmata such as ''every graph has an even number of odd-degree nodes.'' They contain several important problems for which no polynomial time algorithm is presently known, including the computational versions of Sperner's lemma, Brouwer's fixpoint theorem, Chevalley's theorem, and the Borsuk-Ulam theorem, the linear complementarity problem for P-matrices, finding a mixed equilibrium in a non-zero sum game, finding a second Hamilton circuit in a Hamiltonian cubic graph, a second Hamiltonian decomposition in a quartic graph, and others. Some of these problems are shown to be complete.