Pages that link to "Item:Q1329155"
From MaRDI portal
The following pages link to On the complexity of the parity argument and other inefficient proofs of existence (Q1329155):
Displaying 50 items.
- The complexity of equilibria for risk-modeling valuations (Q284585) (← links)
- Computing approximate Nash equilibria in general network revenue management games (Q296621) (← links)
- The give and take game: analysis of a resource sharing game (Q326999) (← links)
- \(\mathsf{PPAD}\)-completeness of polyhedral versions of Sperner's lemma (Q389197) (← links)
- Propositional proofs and reductions between NP search problems (Q435190) (← links)
- Recent development in computational complexity characterization of Nash equilibrium (Q458453) (← links)
- Equilibria, fixed points, and complexity classes (Q458480) (← links)
- Nash equilibria: complexity, symmetries, and approximation (Q458482) (← links)
- A note on proofs of existence of Nash equilibria in finite strategic games, of two players (Q458483) (← links)
- Combinatorial nullstellensatz modulo prime powers and the parity argument (Q490257) (← links)
- Exponentiality of the exchange algorithm for finding another room-partitioning (Q496707) (← links)
- Solving systems of diagonal polynomial equations over finite fields (Q507442) (← links)
- Did the train reach its destination: the complexity of finding a witness (Q509884) (← links)
- On Stackelberg mixed strategies (Q516242) (← links)
- Fixed points, Nash equilibria, and the existential theory of the reals (Q519892) (← links)
- Nested PLS (Q535153) (← links)
- Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree (Q548676) (← links)
- Compactly representing utility functions using weighted goals and the Max aggregator (Q622111) (← links)
- Semidefinite programming for min-max problems and games (Q662286) (← links)
- A FPTAS for computing a symmetric leontief competitive economy equilibrium (Q662291) (← links)
- Reversible simulation of space-bounded computations (Q673645) (← links)
- Interdependent defense games with applications to internet security at the level of autonomous systems (Q725097) (← links)
- Congestion games with malicious players (Q834852) (← links)
- On the complexity of constrained Nash equilibria in graphical games (Q837182) (← links)
- The structure and complexity of Nash equilibria for a selfish routing game (Q838143) (← links)
- On the black-box complexity of Sperner's Lemma (Q839637) (← links)
- Games of fixed rank: a hierarchy of bimatrix games (Q847799) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- Integer factoring and modular square roots (Q896029) (← links)
- Good neighbors are hard to find: Computational complexity of network formation (Q934968) (← links)
- The complexity of uniform Nash equilibria and related regular subgraph problems (Q935157) (← links)
- On the complexity of deciding bimatrix games similarity (Q955038) (← links)
- The complexity of equilibria: Hardness results for economies via a correspondence with games (Q959811) (← links)
- Well supported approximate equilibria in bimatrix games (Q973002) (← links)
- The computation of approximate competitive equilibrium is PPAD-hard (Q975493) (← links)
- The myth of the folk theorem (Q993783) (← links)
- Separable and low-rank continuous games (Q999116) (← links)
- Polynomial algorithms for approximating Nash equilibria of bimatrix games (Q1014631) (← links)
- Existence of equilibria in a decentralized two-level supply chain (Q1014973) (← links)
- The strategic exploitation of limited information and opportunity in networked markets (Q1020531) (← links)
- Paintshop, odd cycles and necklace splitting (Q1028475) (← links)
- On the complexity of 2D discrete fixed point problem (Q1035680) (← links)
- On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games (Q1041739) (← links)
- The relative complexity of NP search problems (Q1273858) (← links)
- Some graphic uses of an even number of odd nodes (Q1296145) (← links)
- The complexity of finding a second Hamiltonian cycle in cubic graphs (Q1307702) (← links)
- Inverting onto functions. (Q1426007) (← links)
- A Sperner lemma complete for PPA (Q1603412) (← links)
- Efficient approximation algorithms for the subset-sums equality problem. (Q1608313) (← links)
- A smooth path-following algorithm for market equilibrium under a class of piecewise-smooth concave utilities (Q1616935) (← links)
