A note on the lower bound for the Price of Anarchy of scheduling games on unrelated machines.
Yujie YanZhihao DingZhiyi TanPublished in: Discret. Appl. Math. (2015)
Keyphrases
- lower bound
- identical parallel machines
- upper bound
- parallel machines
- scheduling problem
- competitive ratio
- branch and bound algorithm
- np hard
- identical machines
- branch and bound
- manufacturing cell
- scheduling algorithm
- strongly np hard
- flowshop
- precedence constraints
- wafer fabrication
- parallel processors
- lower and upper bounds
- objective function
- optimal solution
- worst case
- resource allocation
- game theory
- computer games
- lower bounding
- round robin
- game theoretic
- video games
- lagrangian relaxation
- nash equilibrium
- sufficiently accurate
- single machine
- educational games
- game design
- game playing
- manufacturing systems
- real time database systems
- nash equilibria
- game players
- vc dimension