2322 search results - page 73 / 465 » On a game in directed graphs |
171
click to vote
DM
2007
15 years 6 months ago
2007
Switch-setting games like Lights Out are typically modelled as a graph, where the vertices represent switches and lamps, and the edges capture the switching rules. We generalize t...
132
click to vote
ESA
2010
Springer
15 years 7 months ago
2010
Springer
In this paper we develop a property testing algorithm for the problem of testing whether a directed geometric graph with bounded (out)degree is a (1 + )-spanner.
147
click to vote
COCOA
2009
Springer
16 years 22 days ago
2009
Springer
Abstract. We study Facility Location games played by n agents situated on the nodes of a graph. Each agent orders installation of a facility at a node of the graph and pays connect...
172
click to vote
SIAMDM
2010
15 years 27 days ago
2010
The domination game played on a graph G consists of two players, Dominator and Staller who alternate taking turns choosing a vertex from G such that whenever a vertex is chosen by...
150
click to vote
SIGECOM
2004
ACM
15 years 11 months ago
2004
ACM
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...