A simple method for proving lower bounds in the zero-visibility cops and robber game.
Yuan XueBoting YangSandra ZillesPublished in: J. Comb. Optim. (2022)
Keyphrases
- lower bound
- upper bound
- winning strategy
- branch and bound algorithm
- game theory
- computer games
- branch and bound
- video games
- np hard
- objective function
- worst case
- lower and upper bounds
- vc dimension
- game playing
- game theoretic
- quadratic assignment problem
- game design
- nash equilibria
- optimal strategy
- serious games
- educational games
- linear programming relaxation
- game play
- digital games
- nash equilibrium
- mobile devices