1447 search results - page 11 / 290 » Graphs and Path Equilibria |
DAM
2011
13 years 4 months ago
2011
In 1988, Golumbic and Hammer characterized powers of cycles, relating them to circular-arc graphs. We extend their results and propose several further structural characterizations ...
APPROX
2009
Springer
14 years 4 months ago
2009
Springer
Recently, Hazan and Krauthgamer showed [12] that if, for a fixed small ε, an ε-best ε-approximate Nash equilibrium can be found in polynomial time in two-player games, then it ...
COCOON
2009
Springer
14 years 4 months ago
2009
Springer
Edge-intersection graphs of paths in grids are graphs that can be represented with vertices as paths in grids and edges between the vertices of the graph exist whenever two grid pa...
SIGECOM
2006
ACM
14 years 3 months ago
2006
ACM
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
FMCO
2004
Springer
14 years 3 months ago
2004
Springer
In 2-player non-zero-sum games, Nash equilibria capture the options for rational behavior if each player attempts to maximize her payoff. In contrast to classical game theory, we ...