Sciweavers

2322 search results - page 1 / 465
» On a game in directed graphs
Sort
View
JGAA
2007
123views more  JGAA 2007»
13 years 4 months ago
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
Abstract. Two-player win-lose games have a simple directed graph representation. Exploiting this, we develop graph theoretic techniques for finding Nash equilibria in such games. ...
Louigi Addario-Berry, Neil Olver, Adrian Vetta
IPL
2002
95views more  IPL 2002»
13 years 4 months ago
On a game in directed graphs
Inspired by recent algorithms for electing a leader in a distributed system, we study the following game in a directed graph: each vertex selects one of its outgoing arcs (if any)...
Alan J. Hoffman, Kate Jenkins, Tim Roughgarden
CORR
2008
Springer
91views Education» more  CORR 2008»
13 years 4 months ago
Digraph Decompositions and Monotonicity in Digraph Searching
Abstract. We consider graph searching games on directed graphs and corresponding digraph decompositions. In particular we show that two important variants of these games
Stephan Kreutzer, Sebastian Ordyniak
IJCAI
2007
13 years 6 months ago
Multipotential Games
We introduce and analyze q-potential games and qcongestion games, where q is a positive integer. A 1-potential (congestion) game is a potential (congestion) game. We show that a g...
Dov Monderer
CONCUR
2006
Springer
13 years 8 months ago
Strategy Improvement for Stochastic Rabin and Streett Games
A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions specified as Ra...
Krishnendu Chatterjee, Thomas A. Henzinger