A tight lower bound for the capture time of the Cops and Robbers game.
Sebastian BrandtYuval EmekJara UittoRoger WattenhoferPublished in: Theor. Comput. Sci. (2020)
Keyphrases
- lower bound
- upper bound
- branch and bound
- worst case
- branch and bound algorithm
- np hard
- computer games
- game theory
- objective function
- optimal solution
- video games
- lower and upper bounds
- nash equilibrium
- game play
- virtual world
- lower bounding
- game design
- game playing
- knowledge sharing
- learning games
- sample complexity
- game theoretic
- learning algorithm
- game based learning
- digital games
- nash equilibria
- linear programming relaxation
- game development
- multi agent
- constraint satisfaction problems
- role playing