Pages that link to "Item:Q5449531"

The following pages link to Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix Games (Q5449531):

Displayed 10 items.

• On mutual concavity and strategically-zero-sum bimatrix games (Q428856) ‎ (← links)
• The complexity of uniform Nash equilibria and related regular subgraph problems (Q935157) ‎ (← links)
• Parameterized two-player Nash equilibrium (Q1949741) ‎ (← 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)
• (In)existence of equilibria for 2-player, 2-value games with semistrictly quasiconcave cost functions (Q2082560) ‎ (← links)
• Parameterized complexity of sparse linear complementarity problems (Q2408196) ‎ (← links)
• The complexity of computational problems about Nash equilibria in symmetric win-lose games (Q2659767) ‎ (← links)
• Some Tractable Win-Lose Games (Q3010417) ‎ (← links)
• The Linear Complementarity Problems with a Few Variables per Constraint (Q3465945) ‎ (← links)
• Constant Rank Two-Player Games are PPAD-hard (Q4554071) ‎ (← links)