Pages that link to "Item:Q3613786"
From MaRDI portal
The following pages link to The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games (Q3613786):
Displaying 12 items.
- Action-graph games (Q625044) (← 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)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- On the complexity of succinct zero-sum games (Q1024660) (← links)
- The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game (Q1995464) (← links)
- Computing equilibria in multi-player games (Q2921656) (← links)
- Multilinear Games (Q2959817) (← links)
- A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium (Q3162514) (← links)
- Weighted Boolean Formula Games (Q3464467) (← links)
- Fully Polynomial-Time Approximation Schemes for Fair Rent Division (Q5868945) (← links)
- Risk-free bidding in complement-free combinatorial auctions (Q5918704) (← links)