Pages that link to "Item:Q3452212"
From MaRDI portal
The following pages link to Settling the complexity of computing two-player Nash equilibria (Q3452212):
Displaying 50 items.
- Computing approximate Nash equilibria in general network revenue management games (Q296621) (← links)
- Approximate well-supported Nash equilibria below two-thirds (Q329276) (← links)
- On the performance of mildly greedy players in cut games (Q346481) (← links)
- Mixing time and stationary expected social welfare of logit dynamics (Q372983) (← links)
- On the approximation performance of fictitious play in finite games (Q378343) (← links)
- \(\mathsf{PPAD}\)-completeness of polyhedral versions of Sperner's lemma (Q389197) (← links)
- Computing approximate Nash equilibria in polymatrix games (Q513277) (← links)
- On Stackelberg mixed strategies (Q516242) (← links)
- The computational complexity of weak saddles (Q647484) (← links)
- Semidefinite programming for min-max problems and games (Q662286) (← links)
- Distributed methods for computing approximate equilibria (Q666675) (← links)
- Interdependent defense games with applications to internet security at the level of autonomous systems (Q725097) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- On the complexity of deciding bimatrix games similarity (Q955038) (← links)
- A note on approximate Nash equilibria (Q1014628) (← links)
- On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering (Q1637226) (← links)
- Computing pure Nash equilibria in network revenue management games (Q1656431) (← links)
- Complexity of rational and irrational Nash equilibria (Q1678771) (← links)
- Colorful linear programming, Nash equilibrium, and pivots (Q1707915) (← links)
- Computing solutions of the multiclass network equilibrium problem with affine cost functions (Q1730728) (← links)
- Equilibrium paths in discounted supergames (Q1741494) (← links)
- Towards a unified complexity theory of total functions (Q1745728) (← links)
- Approximation schemes for stochastic mean payoff games with perfect information and few random positions (Q1755732) (← links)
- Limited lookahead in imperfect-information games (Q1989388) (← links)
- The complexity of \((\mathsf{E}+\mathsf{Var})\)-equilibria, \(\mathsf{ESR}\)-equilibria, and \(\mathsf{SuperE}\)-equilibria for 2-players games with few cost values (Q1998841) (← links)
- Lipschitz continuity and approximate equilibria (Q2006946) (← links)
- 2-D Tucker is PPA complete (Q2009648) (← links)
- The complexity of the parity argument with potential (Q2037189) (← links)
- Continuous verifiable delay functions (Q2055650) (← links)
- (In)existence of equilibria for 2-player, 2-value games with semistrictly quasiconcave cost functions (Q2082560) (← links)
- The complexity of finding fair independent sets in cycles (Q2087771) (← links)
- Two's company, three's a crowd: consensus-halving for a constant number of agents (Q2093385) (← links)
- Multi-agent reinforcement learning: a selective overview of theories and algorithms (Q2094040) (← links)
- Discrete versions of the KKM lemma and their PPAD-completeness (Q2097223) (← links)
- Characterising the intersection of QMA and coQMA (Q2099640) (← links)
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
- Delegation with updatable unambiguous proofs and PPAD-hardness (Q2104236) (← links)
- Equilibrium computation in resource allocation games (Q2149542) (← links)
- Communication complexity of approximate Nash equilibria (Q2155907) (← links)
- An algorithm for finding approximate Nash equilibria in bimatrix games (Q2157005) (← links)
- LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization (Q2164699) (← links)
- From minicrypt to obfustopia via private-key functional encryption (Q2175213) (← links)
- Learning convex partitions and computing game-theoretic equilibria from best response queries (Q2190390) (← links)
- Unique end of potential line (Q2194856) (← links)
- Tatonnement beyond gross substitutes? Gradient descent to the rescue (Q2206817) (← links)
- Understanding PPA-completeness (Q2208253) (← links)
- Computing exact solutions of consensus halving and the Borsuk-Ulam theorem (Q2221804) (← links)
- The Hairy Ball problem is PPAD-complete (Q2229948) (← links)
- Cache me if you can: capacitated selfish replication games in networks (Q2300628) (← links)
- Pure Nash equilibria in graphical games and treewidth (Q2343086) (← links)
