Pages that link to "Item:Q3177813"
From MaRDI portal
The following pages link to Query Complexity of Approximate Nash Equilibria (Q3177813):
Displaying 8 items.
- An abstraction-refinement methodology for reasoning about network games (Q1630443) (← links)
- Learning convex partitions and computing game-theoretic equilibria from best response queries (Q2190390) (← links)
- Lower bounds for the query complexity of equilibria in Lipschitz games (Q2670917) (← links)
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q5020727) (← links)
- Optimally Deceiving a Learning Leader in Stackelberg Games (Q5026202) (← links)
- Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds (Q5138782) (← links)
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q6139831) (← links)
- Lower bounds for the query complexity of equilibria in Lipschitz games (Q6159025) (← links)
