Pages that link to "Item:Q3575160"
From MaRDI portal
The following pages link to Playing Games with Approximation Algorithms (Q3575160):
Displaying 9 items.
- Games, complexity classes, and approximation algorithms. (Q1126837) (← links)
- Stochastic continuum-armed bandits with additive models: minimax regrets and adaptive algorithm (Q2091834) (← links)
- Online learning for min-max discrete problems (Q2166779) (← links)
- Online linear optimization and adaptive routing (Q2462507) (← links)
- Online Linear Optimization for Job Scheduling Under Precedence Constraints (Q2835641) (← links)
- (Q4535005) (← links)
- Efficient Online Linear Optimization with Approximation Algorithms (Q4991673) (← links)
- Per-Round Knapsack-Constrained Linear Submodular Bandits (Q5380603) (← links)
- An \(\alpha \)-regret analysis of adversarial bilateral trade (Q6665707) (← links)