Sciweavers

344 search results - page 25 / 69
» Banach-Mazur Games on Graphs
Sort
View
GD
2007
Springer
14 years 2 months ago
Moving Vertices to Make Drawings Plane
In John Tantalo’s on-line game Planarity the player is given a non-plane straight-line drawing of a planar graph. The aim is to make the drawing plane as quickly as possible by m...
Xavier Goaoc, Jan Kratochvíl, Yoshio Okamot...
WINE
2009
Springer
171views Economy» more  WINE 2009»
14 years 3 months ago
The Impact of Social Ignorance on Weighted Congestion Games
We consider weighted linear congestion games, and investigate how social ignorance, namely lack of information about the presence of some players, affects the inefficiency of pure...
Dimitris Fotakis, Vasilis Gkatzelis, Alexis C. Kap...
MOBIHOC
2012
ACM
11 years 11 months ago
Spatial spectrum access game: nash equilibria and distributed learning
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
Xu Chen, Jianwei Huang
AVI
2004
13 years 10 months ago
Using games to investigate movement for graph comprehension
We describe the results of empirical investigations that explore the effectiveness of moving graph diagrams to improve the comprehension of their structure. The investigations inv...
John Bovey, Florence Benoy, Peter Rodgers
SIAMDM
2010
119views more  SIAMDM 2010»
13 years 3 months ago
Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem
The firefighter problem is the following discrete-time game on a graph. Initially, a fire starts at a vertex of the graph. In each round, a firefighter protects one vertex not yet ...
Leizhen Cai, Yongxi Cheng, Elad Verbin, Yuan Zhou