Sciweavers

356 search results - page 41 / 72
» Graph Games on Ordinals
Sort
View
ICPR
2010
IEEE
14 years 7 months ago
Rectifying Non-Euclidean Similarity Data Using Ricci Flow Embedding
Similarity based pattern recognition is concerned with the analysis of patterns that are specified in terms of object dissimilarity or proximity rather than ordinal values. For man...
Weiping Xu, Edwin R. Hancock, Richard C. Wilson
GD
2007
Springer
15 years 3 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»
15 years 4 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...
ATAL
2010
Springer
14 years 10 months ago
Path disruption games
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
Yoram Bachrach, Ely Porat
CSL
2006
Springer
15 years 1 months ago
Solving Games Without Determinization
The synthesis of reactive systems requires the solution of two-player games on graphs with -regular objectives. When the objective is specified by a linear temporal logic formula o...
Thomas A. Henzinger, Nir Piterman