Bounding the Uncertainty of Graphical Games: The Complexity of Simple Requirements, Pareto and Strong Nash Equilibria.
Gianluigi GrecoFrancesco ScarcelloPublished in: UAI (2005)
Keyphrases
- nash equilibria
- incomplete information
- game theory
- stochastic games
- fictitious play
- nash equilibrium
- game theoretic
- solution concepts
- pure strategy
- multi objective
- congestion games
- upper bound
- multiagent learning
- mixed strategy
- pareto optimal
- decision problems
- resource allocation
- evolutionary algorithm
- artificial intelligence
- genetic algorithm