Discrete versions of the KKM lemma and their PPAD-completeness
From MaRDI portal
Publication:2097223
Cites work
- Algorithmic Game Theory
- Consensus-halving via theorems of Borsuk-Ulam and Tucker
- Equilibrium in a discrete exchange economy with money
- Equilibrium points in n -person games
- Existence of an Equilibrium for a Competitive Economy
- scientific article; zbMATH DE number 5942357 (Why is no real title available?)
- scientific article; zbMATH DE number 3890210 (Why is no real title available?)
- scientific article; zbMATH DE number 6866322 (Why is no real title available?)
- scientific article; zbMATH DE number 3422228 (Why is no real title available?)
- Market equilibrium under separable, piecewise-linear, concave utilities
- Non-cooperative games
- On equilibria in finite games
- On the complexity of 2D discrete fixed point problem
- On the Complexity of Nash Equilibria and Other Fixed Points
- On the complexity of the parity argument and other inefficient proofs of existence
- On total functions, existence theorems and computational complexity
- Reducibility among fractional stability problems
- Rental Harmony: Sperner's Lemma in Fair Division
- Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities
- Settling the complexity of computing two-player Nash equilibria
- Settling the complexity of Leontief and PLC exchange markets under exact and approximate equilibria
- Settling the complexity of Nash equilibrium in congestion games
- The complexity of computing a Nash equilibrium
- The Core of an N Person Game
- The Hairy Ball problem is PPAD-complete
- The relative complexity of NP search problems
This page was built for publication: Discrete versions of the KKM lemma and their PPAD-completeness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2097223)
