37 search results - page 6 / 8 » Nash Equilibria in Voronoi Games on Graphs |
131
click to vote
ESA
2009
Springer
15 years 8 months ago
2009
Springer
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
APPROX
2009
Springer
15 years 8 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 ...
COCOA
2009
Springer
15 years 8 months 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...
84
Voted
SIAMCOMP
2010
14 years 12 months ago
2010
Designing and deploying a network protocol determines the rules by which end users interact with each other and with the network. We consider the problem of designing a protocol t...
102
click to vote
CONCUR
2007
Springer
15 years 7 months ago
2007
Springer
We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properti...