Sciweavers

22 search results - page 2 / 5
» Local and global price of anarchy of graphical games
Sort
View
ICDCS
2010
IEEE
13 years 8 months ago
Existence Theorems and Approximation Algorithms for Generalized Network Security Games
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
V. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun,...
SPAA
2010
ACM
13 years 9 months ago
Basic network creation games
We study a natural network creation game, in which each node locally tries to minimize its local diameter or its local average distance to other nodes, by swapping one incident ed...
Noga Alon, Erik D. Demaine, MohammadTaghi Hajiagha...
IDC
2009
Springer
13 years 11 months ago
Cost of Cooperation for Scheduling Meetings
Scheduling meetings among agents can be represented as a game - the Meetings Scheduling Game (MSG). In its simplest form, the two-person MSG is shown to have a price of anarchy (Po...
Alon Grubshtein, Amnon Meisels
CORR
2008
Springer
154views Education» more  CORR 2008»
13 years 4 months ago
On Pure and (approximate) Strong Equilibria of Facility Location Games
We study social cost losses in Facility Location games, where n selfish agents install facilities over a network and connect to them, so as to forward their local demand (expressed...
Thomas Dueholm Hansen, Orestis Telelis
CG
2004
Springer
13 years 8 months ago
Locally Informed Global Search for Sums of Combinatorial Games
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
Martin Müller 0003, Zhichao Li