A Tight Lower Bound for an Online Hypercube Packing Problem and Bounds for Prices of Anarchy of a Related Game.
Yoshiharu KohayakawaFlávio Keidi MiyazawaYoshiko WakabayashiPublished in: LATIN (2018)
Keyphrases
- lower bound
- upper bound
- packing problem
- online algorithms
- lower and upper bounds
- worst case
- branch and bound algorithm
- np hard
- branch and bound
- bin packing
- objective function
- upper and lower bounds
- online learning
- optimal solution
- online markets
- integer programming
- online game
- cutting plane
- computer games
- yield management
- game theory
- search costs
- arbitrary shaped
- randomized algorithm
- game playing
- sample complexity
- search space
- reinforcement learning
- linear programming
- parallel algorithm
- video games