Playing Games with Approximation Algorithms
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1834637
- Playing games with algorithms: algorithmic combinatorial game theory
- Approximation algorithms for unique games
- The approximation complexity of win-lose games
- Improved approximation algorithms for projection games
- Games, complexity classes, and approximation algorithms.
- Algorithms for Playing Games with Limited Randomness
- scientific article; zbMATH DE number 177098
- Near-optimal algorithms for unique games
- scientific article; zbMATH DE number 549853
Cited in
(11)- Per-round knapsack-constrained linear submodular bandits
- Efficient online linear optimization with approximation algorithms
- Games, complexity classes, and approximation algorithms.
- Online learning of facility locations
- Online influence maximization with local observations
- Online learning for min-max discrete problems
- Online Linear Optimization for Job Scheduling Under Precedence Constraints
- scientific article; zbMATH DE number 1754580 (Why is no real title available?)
- An \(\alpha \)-regret analysis of adversarial bilateral trade
- Online linear optimization and adaptive routing
- Stochastic continuum-armed bandits with additive models: minimax regrets and adaptive algorithm
This page was built for publication: Playing Games with Approximation Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3575160)
