Pages that link to "Item:Q3068643"
From MaRDI portal
The following pages link to On the Complexity of Nash Equilibria and Other Fixed Points (Q3068643):
Displayed 50 items.
- Belief and truth in hypothesised behaviours (Q274416) (← links)
- On perfect Nash equilibria of polymatrix games (Q457873) (← links)
- Equilibria, fixed points, and complexity classes (Q458480) (← links)
- Nash equilibria: complexity, symmetries, and approximation (Q458482) (← links)
- Computing approximate Nash equilibria in polymatrix games (Q513277) (← links)
- On Stackelberg mixed strategies (Q516242) (← links)
- Fixed points, Nash equilibria, and the existential theory of the reals (Q519892) (← links)
- On the complexity of constrained Nash equilibria in graphical games (Q837182) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- New algorithms for approximate Nash equilibria in bimatrix games (Q1041233) (← links)
- The complexity of optimal multidimensional pricing for a unit-demand buyer (Q1651230) (← links)
- Complexity of rational and irrational Nash equilibria (Q1678771) (← links)
- Approximating maxmin strategies in imperfect recall games using A-loss recall property (Q1726399) (← links)
- The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game (Q1995464) (← links)
- Lipschitz continuity and approximate equilibria (Q2006946) (← links)
- Two's company, three's a crowd: consensus-halving for a constant number of agents (Q2093385) (← links)
- Discrete versions of the KKM lemma and their PPAD-completeness (Q2097223) (← links)
- Computational complexity of computing a quasi-proper equilibrium (Q2140505) (← links)
- Unique end of potential line (Q2194856) (← links)
- Computing exact solutions of consensus halving and the Borsuk-Ulam theorem (Q2221804) (← links)
- The Hairy Ball problem is PPAD-complete (Q2229948) (← links)
- On the entropy of couplings (Q2346421) (← links)
- Query complexity of approximate equilibria in anonymous games (Q2403236) (← links)
- Recursive stochastic games with positive rewards (Q2422034) (← links)
- Uniqueness of stationary equilibrium payoffs in coalitional bargaining (Q2434224) (← links)
- Understanding science through the computational lens (Q2434533) (← links)
- The complexity of computational problems about Nash equilibria in symmetric win-lose games (Q2659767) (← links)
- Recursive Markov Decision Processes and Recursive Stochastic Games (Q2796398) (← links)
- The Exact Computational Complexity of Evolutionarily Stable Strategies (Q2937749) (← links)
- Ratio and Weight Quantiles (Q2946351) (← links)
- The Complexity of Nash Equilibria in Limit-Average Games (Q3090850) (← links)
- On Nash-Equilibria of Approximation-Stable Games (Q3162509) (← links)
- A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium (Q3162514) (← links)
- 2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties (Q3162530) (← links)
- Graph Games and Reactive Synthesis (Q3176385) (← links)
- ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria (Q3448815) (← links)
- A Complementary Pivot Algorithm for Market Equilibrium under Separable, Piecewise-Linear Concave Utilities (Q3460332) (← links)
- Query Complexity of Approximate Equilibria in Anonymous Games (Q3460801) (← links)
- Bounding the sum of square roots via lattice reduction (Q3584821) (← links)
- Constant Rank Two-Player Games are PPAD-hard (Q4554071) (← links)
- Computational tameness of classical non-causal models (Q4556871) (← links)
- Incentive Stackelberg Mean-Payoff Games (Q4571136) (← links)
- (Q4638112) (← links)
- Fast Algorithms for Rank-1 Bimatrix Games (Q4994178) (← links)
- Nash Equilibrium Points for Generalized Matrix Game Model with Interval Payoffs (Q5038394) (← links)
- (Q5089213) (← links)
- (Q5090455) (← links)
- Unique End of Potential Line (Q5091211) (← links)
- The Hairy Ball Problem is PPAD-Complete. (Q5091222) (← links)
- Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem (Q5092341) (← links)