Sciweavers

59 search results - page 4 / 12
» Resource selection games with unknown number of players
Sort
View
JAL
2002
99views more  JAL 2002»
13 years 5 months ago
Kayles and Nimbers
Kayles is a combinatorial game on graphs. Two players select alternatingly a vertex from a given graph G - a chosen vertex may not be adjacent or equal to an already chosen vertex...
Hans L. Bodlaender, Dieter Kratsch
MST
2010
93views more  MST 2010»
13 years 3 months ago
Atomic Congestion Games: Fast, Myopic and Concurrent
We study here the effect of concurrent greedy moves of players in atomic congestion games where n selfish agents (players) wish to select a resource each (out of m resources) so ...
Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spira...
SIROCCO
2008
13 years 6 months ago
Word of Mouth: Rumor Dissemination in Social Networks
In this paper we examine the diffusion of competing rumors in social networks. Two players select a disjoint subset of nodes as initiators of the rumor propagation, seeking to maxi...
Jan Kostka, Yvonne Anne Oswald, Roger Wattenhofer
IJAMC
2010
102views more  IJAMC 2010»
13 years 3 months ago
QuON: a quad-tree-based overlay protocol for distributed virtual worlds
—Massively Multiplayer Online Games and Virtual Worlds are among the most popular applications on the Internet. As player numbers increase, the limits of the currently dominant c...
Helge Backhaus, Stephan Krause
WINE
2009
Springer
127views Economy» more  WINE 2009»
13 years 12 months ago
Nash Dynamics in Congestion Games with Similar Resources
We study convergence of ε-Nash dynamics in congestion games when delay functions of all resources are similar. Delay functions are said to be similar if their values are within a...
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna