A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game.
Yoshiharu KohayakawaFlavio Keidi MiyazawaYoshiko WakabayashiPublished in: CoRR (2017)
Keyphrases
- lower bound
- upper bound
- packing problem
- online algorithms
- lower and upper bounds
- branch and bound algorithm
- worst case
- branch and bound
- objective function
- online learning
- optimal solution
- online game
- upper and lower bounds
- computer games
- game theory
- search costs
- game playing
- online markets
- np hard
- parallel algorithm
- long run
- video games
- educational games
- integer programming
- euclidean distance
- dynamic programming
- cutting plane
- linear programming relaxation
- linear program
- arbitrary shaped
- comparison shopping
- constraint programming