Pages that link to "Item:Q2516247"
From MaRDI portal
The following pages link to Near-optimal no-regret algorithms for zero-sum games (Q2516247):
Displaying 5 items.
- Faster algorithms for extensive-form game solving via improved smoothing functions (Q2288198) (← links)
- Introduction to the special issue -- Algorithmic game theory -- STOC/FOCS/SODA 2011 (Q2516241) (← links)
- Adversarial bandits with knapsacks (Q6551256) (← links)
- Multiagent learning for competitive opinion optimization (Q6614028) (← links)
- Accelerated minimax algorithms flock together (Q6663115) (← links)
