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.
- Polynomial-time computation of exact correlated equilibrium in compact games (Q2347787) (← links)
- Query complexity of approximate equilibria in anonymous games (Q2403236) (← links)
- Parameterized complexity of sparse linear complementarity problems (Q2408196) (← links)
- Recursive stochastic games with positive rewards (Q2422034) (← links)
- Computational aspects of uncertainty profiles and angel-daemon games (Q2441541) (← links)
- On the communication complexity of approximate Nash equilibria (Q2442839) (← links)
- The complexity of computational problems about Nash equilibria in symmetric win-lose games (Q2659767) (← links)
- Belief-invariant and quantum equilibria in games of incomplete information (Q2664942) (← links)
- On tightness of the Tsaknakis-Spirakis algorithm for approximate Nash equilibrium (Q2670913) (← links)
- Beyond the worst-case analysis of random priority: smoothed and average-case approximation ratios in mechanism design (Q2672280) (← links)
- Total functions in QMA (Q2684235) (← links)
- Lipschitz Continuity and Approximate Equilibria (Q2819444) (← links)
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium (Q2829231) (← links)
- The Exact Computational Complexity of Evolutionarily Stable Strategies (Q2937749) (← links)
- On Pure Nash Equilibria in Stochastic Games (Q2948480) (← links)
- Computing Equilibria with Partial Commitment (Q2959814) (← links)
- Distributed Methods for Computing Approximate Equilibria (Q2959815) (← links)
- Some Tractable Win-Lose Games (Q3010417) (← links)
- Automatizability and Simple Stochastic Games (Q3012836) (← links)
- Inapproximability of NP-Complete Variants of Nash Equilibrium (Q3088077) (← links)
- The Complexity of Nash Equilibria in Limit-Average Games (Q3090850) (← links)
- 2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties (Q3162530) (← links)
- ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria (Q3448815) (← links)
- Settling Some Open Problems on 2-Player Symmetric Nash Equilibria (Q3449600) (← links)
- Approximating Nash Equilibria in Tree Polymatrix Games (Q3449601) (← links)
- Smoothed Analysis of Local Search Algorithms (Q3449848) (← 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)
- Inverse Game Theory: Learning Utilities in Succinct Games (Q3460806) (← links)
- A Glimpse at Paul G. Spirakis (Q3464465) (← links)
- Weighted Boolean Formula Games (Q3464467) (← links)
- The Linear Complementarity Problems with a Few Variables per Constraint (Q3465945) (← links)
- Constant Rank Two-Player Games are PPAD-hard (Q4554071) (← links)
- The Computational Complexity of Finding a Mixed Berge Equilibrium for a k-Person Noncooperative Game in Normal Form (Q4557743) (← links)
- Inapproximability of Nash Equilibrium (Q4571923) (← links)
- Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathéodory's Theorem (Q4571924) (← links)
- Sperner’s Colorings and Optimal Partitioning of the Simplex (Q4604392) (← links)
- Network Essence: PageRank Completion and Centrality-Conforming Markov Chains (Q4604398) (← links)
- (Q4638112) (← links)
- The Journey from NP to TFNP Hardness (Q4638115) (← links)
- Towards a Unified Complexity Theory of Total Functions (Q4993302) (← links)
- Fast Algorithms for Rank-1 Bimatrix Games (Q4994178) (← links)
- (Q5005124) (← links)
- Amortized Analysis of Asynchronous Price Dynamics (Q5009575) (← links)
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q5020727) (← links)
- On the complexity of stable fractional hypergraph matching (Q5091001) (← 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)
- Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds (Q5138782) (← links)
