Bounding an Optimal Search Path with a Game of Cop and Robber on Graphs.
Frédéric SimardMichael MorinClaude-Guy QuimperFrançois LavioletteJosée DesharnaisPublished in: CP (2015)
Keyphrases
- graph theoretic
- graph theory
- random graphs
- shortest path
- winning strategy
- game theory
- upper bound
- computer games
- video games
- educational games
- game playing
- game design
- game play
- minimum cost
- nash equilibrium
- knowledge sharing
- monte carlo tree search
- search algorithm
- cooperative
- virtual communities
- graph matching
- wireless sensor networks
- game players
- mobile games
- cooperative game