28 search results - page 1 / 6 » Constraint satisfaction algorithms for graphical games |
90
Voted
ATAL
2007
Springer
15 years 4 months ago
2007
Springer
We formulate the problem of computing equilibria in multiplayer games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. T...
95
Voted
SODA
2010
ACM
15 years 7 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
88
Voted
CSCLP
2007
Springer
15 years 4 months ago
2007
Springer
The notion of optimality naturally arises in many areas of applied mathematics and computer science concerned with decision making. Here we consider this notion in the context of ...
86
Voted
APPROX
2008
Springer
15 years 2 days ago
2008
Springer
CSL
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We define an abstract pebble game that provides game interpretations for essentially all known consistency algorithms for constraint satisfaction problems including arc-...