Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games.
Ioannis CaragiannisAngelo FanelliNick GravinPublished in: Algorithmica (2017)
Keyphrases
- constraint satisfaction
- nash equilibria
- game theoretic
- game theory
- nash equilibrium
- constraint satisfaction problems
- pure nash equilibria
- heuristic search
- pure strategy
- constraint relaxation
- relaxation labeling
- pure nash equilibrium
- constraint programming
- extensive form games
- repeated games
- probabilistic reasoning
- incomplete information
- video games
- phase transition
- russian doll search
- product configuration
- constraint problems
- arc consistency
- constraint propagation
- combinatorial problems
- sequential patterns
- constraint solving
- stochastic games
- mixed strategy
- constraint networks
- soft constraints
- sat solvers
- expert systems
- genetic algorithm
- randomly generated
- computer games
- decision problems
- np complete
- robust fault detection
- search space