Pages that link to "Item:Q2947564"
From MaRDI portal
The following pages link to The Computational Complexity of Nash Equilibria in Concisely Represented Games (Q2947564):
Displaying 14 items.
- Equilibria of graphical games with symmetries (Q627165) (← links)
- The complexity of game isomorphism (Q650900) (← links)
- Equilibria problems on games: complexity versus succinctness (Q657923) (← links)
- Ranking games (Q835803) (← links)
- On the complexity of constrained Nash equilibria in graphical games (Q837182) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- New complexity results about Nash equilibria (Q932810) (← links)
- Symmetries and the complexity of pure Nash equilibrium (Q1004282) (← links)
- Simulating cardinal preferences in Boolean games: a proof technique (Q1641024) (← links)
- The complexity of decision problems about equilibria in two-player Boolean games (Q1648073) (← links)
- Weighted Boolean Formula Games (Q3464467) (← links)
- On the Complexity of Equilibria Problems in Angel-Daemon Games (Q3511310) (← links)
- Inapproximability of Nash Equilibrium (Q4571923) (← links)
- PPAD-complete approximate pure Nash equilibria in Lipschitz games (Q6069844) (← links)
