On the Performance of Congestion Games for Optimum Satisfiability Problems.
Aristotelis GiannakosLaurent GourvèsJérôme MonnotVangelis Th. PaschosPublished in: WINE (2007)
Keyphrases
- satisfiability problem
- congestion games
- np complete
- temporal logic
- search algorithm
- phase transition
- pure nash equilibria
- sat problem
- nash equilibria
- solving hard
- sat instances
- stochastic local search
- pspace complete
- pure nash equilibrium
- cost function
- nash equilibrium
- game theory
- constraint satisfaction
- max sat
- finite domain
- knowledge base