Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games.
Ioannis CaragiannisAngelo FanelliNick GravinPublished in: CoRR (2014)
Keyphrases
- constraint satisfaction
- nash equilibria
- game theoretic
- game theory
- nash equilibrium
- constraint satisfaction problems
- pure nash equilibria
- phase transition
- heuristic search
- constraint programming
- relaxation labeling
- extensive form games
- pure strategy
- incomplete information
- constraint propagation
- arc consistency
- repeated games
- stochastic games
- constraint solving
- combinatorial problems
- product configuration
- constraint relaxation
- pure nash equilibrium
- probabilistic reasoning
- sat solvers
- constraint problems
- computer games
- constraint optimization
- russian doll search
- robust fault detection
- soft constraints
- constrained problems
- path consistency
- computational complexity
- video games
- np complete