Playing Games with Approximation Algorithms

DOI10.1137/070701704zbMath1192.68909OpenAlexW2051259245MaRDI QIDQ3575160

Katrina Ligett, Sham M. Kakade, Adam Tauman Kalai

Publication date: 7 July 2010

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://repository.upenn.edu/statistics_papers/117

zbMATH Keywords

online algorithmsapproximation algorithmsregret minimizationonline linear optimization

Mathematics Subject Classification ID

Approximation algorithms (68W25) General topics in the theory of algorithms (68W01) Online algorithms; streaming algorithms (68W27)

Related Items (5)

Online learning for min-max discrete problems ⋮ Per-Round Knapsack-Constrained Linear Submodular Bandits ⋮ Online Linear Optimization for Job Scheduling Under Precedence Constraints ⋮ Efficient Online Linear Optimization with Approximation Algorithms ⋮ Stochastic continuum-armed bandits with additive models: minimax regrets and adaptive algorithm

This page was built for publication: Playing Games with Approximation Algorithms