Pages that link to "Item:Q932810"
From MaRDI portal
The following pages link to New complexity results about Nash equilibria (Q932810):
Displaying 30 items.
- On Pure Nash Equilibria in Stochastic Games (Q2948480) (← links)
- Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms (Q2957451) (← links)
- Computing Equilibria with Partial Commitment (Q2959814) (← links)
- Inapproximability Results for Approximate Nash Equilibria (Q2959816) (← links)
- Single Parameter FPT-Algorithms for Non-trivial Games (Q3000500) (← links)
- Pairwise-Interaction Games (Q3012801) (← links)
- Inapproximability of NP-Complete Variants of Nash Equilibrium (Q3088077) (← links)
- The Complexity of Nash Equilibria in Limit-Average Games (Q3090850) (← links)
- When the Players Are Not Expectation Maximizers (Q3162502) (← links)
- How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard? (Q3162503) (← links)
- A Note on Game Theory and Verification (Q3297580) (← 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)
- Weighted Boolean Formula Games (Q3464467) (← links)
- Malicious Bayesian Congestion Games (Q3602834) (← links)
- A Logic for Reasoning about Rational Agents (Q3602940) (← links)
- The Computational Complexity of Finding a Mixed Berge Equilibrium for a k-Person Noncooperative Game in Normal Form (Q4557743) (← links)
- Persuasion and dynamic communication (Q4585998) (← links)
- (Q4936267) (← links)
- Optimal Off-line Experimentation for Games (Q4991767) (← links)
- Semidefinite Programming and Nash Equilibria in Bimatrix Games (Q4995090) (← links)
- Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm (Q5219680) (← links)
- Strategic Characterization of the Index of an Equilibrium (Q5459988) (← links)
- On the Complexity of Equilibrium Computation in First-Price Auctions (Q5885597) (← links)
- Approximating the existential theory of the reals (Q5918470) (← links)
- On the computational complexity of decision problems about multi-player Nash equilibria (Q5918702) (← links)
- Approximating the existential theory of the reals (Q5918881) (← links)
- Conditional value-at-risk: structure and complexity of equilibria (Q5919335) (← links)
- The real computational complexity of minmax value and equilibrium refinements in multi-player games (Q5919609) (← links)
- Computational complexity of decision problems about Nash equilibria in win-lose multi-player games (Q6546277) (← links)