Splitting graphs when calculating Myerson value for pure overhead games.
Daniel GómezEnrique González-ArangüenaConrado ManuelGuillermo OwenMónica del PozoJuan TejadaPublished in: Math. Methods Oper. Res. (2004)
Keyphrases
- video games
- computer games
- graph matching
- nash equilibria
- nash equilibrium
- graph theoretic
- graph theory
- graph model
- graph structure
- graph representation
- game theoretic
- game play
- educational games
- directed graph
- series parallel
- weighted majority
- learning agents
- perfect information
- bayesian networks
- graph clustering
- graph partitioning
- game design
- search algorithm
- data structure