344 search results - page 52 / 69 » Banach-Mazur Games on Graphs |
101
click to vote
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
CSL
2006
Springer
15 years 1 months ago
2006
Springer
The synthesis of reactive systems requires the solution of two-player games on graphs with -regular objectives. When the objective is specified by a linear temporal logic formula o...
66
Voted
CG
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. A one-player, finite, probabilistic game with perfect information can be presented as a bipartite graph. For one-player Can't Stop, the graph is cyclic and the chall...
APPROX
2009
Springer
15 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 ...
71
Voted
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
— This paper studies connectivity maintenance of robotic networks that communicate at discrete times and move in continuous space. We propose a distributed algorithm that allows ...