Pages that link to "Item:Q847799"
From MaRDI portal
The following pages link to Games of fixed rank: a hierarchy of bimatrix games (Q847799):
Displaying 18 items.
- On mutual concavity and strategically-zero-sum bimatrix games (Q428856) (← links)
- Nash equilibria: complexity, symmetries, and approximation (Q458482) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- Well supported approximate equilibria in bimatrix games (Q973002) (← links)
- Separable and low-rank continuous games (Q999116) (← links)
- A note on approximate Nash equilibria (Q1014628) (← links)
- Parameterized two-player Nash equilibrium (Q1949741) (← links)
- (Q2934707) (redirect page) (← links)
- Settling Some Open Problems on 2-Player Symmetric Nash Equilibria (Q3449600) (← links)
- A Glimpse at Paul G. Spirakis (Q3464465) (← links)
- Constant Rank Two-Player Games are PPAD-hard (Q4554071) (← links)
- Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathéodory's Theorem (Q4571924) (← links)
- (Q4638112) (← links)
- Fast Algorithms for Rank-1 Bimatrix Games (Q4994178) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games (Q6055559) (← links)
- Detection thresholds in very sparse matrix completion (Q6072328) (← links)
- Semidefinite games (Q6665440) (← links)
