Pages that link to "Item:Q1004282"
From MaRDI portal
The following pages link to Symmetries and the complexity of pure Nash equilibrium (Q1004282):
Displaying 22 items.
- A note on the symmetry of all Nash equilibria in games with increasing best replies (Q272217) (← links)
- The computation of Nash equilibrium in fashion games via semi-tensor product method (Q328801) (← links)
- On the complexity of Pareto-optimal Nash and strong equilibria (Q372955) (← links)
- Nash equilibria: complexity, symmetries, and approximation (Q458482) (← links)
- Nash equilibria in symmetric graph games with partial observation (Q528190) (← links)
- Equilibria of graphical games with symmetries (Q627165) (← links)
- Equilibria problems on games: complexity versus succinctness (Q657923) (← links)
- Some results of Maria Serna on strategic games: complexity of equilibria and models (Q826318) (← links)
- Symmetric games revisited (Q1737120) (← links)
- Subgames within large games and the heuristic of imitation (Q2016082) (← links)
- Reasoning in large games with unboundedly many players (Q2148813) (← links)
- Query complexity of approximate equilibria in anonymous games (Q2403236) (← links)
- Equilibrium computation of the Hart and Mas-Colell bargaining model (Q2637848) (← links)
- Pairwise-Interaction Games (Q3012801) (← links)
- Dynamic Restriction of Choices: Synthesis of Societal Rules (Q3093994) (← links)
- On the Complexity of Pareto-optimal Nash and Strong Equilibria (Q3162529) (← links)
- Query Complexity of Approximate Equilibria in Anonymous Games (Q3460801) (← links)
- Weighted Boolean Formula Games (Q3464467) (← links)
- (Q4972730) (← links)
- Mixed-strategy Nash equilibrium for a discontinuous symmetric<i>N</i>-player game (Q5374101) (← links)
- DYNAMICS OF CHOICE RESTRICTION IN LARGE GAMES (Q5396049) (← links)
- QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency (Q5756570) (← links)
