Sciweavers

1884 search results - page 36 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
COCO
2008
Springer
129views Algorithms» more  COCO 2008»
14 years 11 months ago
Constraint Logic: A Uniform Framework for Modeling Computation as Games
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
Erik D. Demaine, Robert A. Hearn
DATAMINE
2010
189views more  DATAMINE 2010»
14 years 10 months ago
A game-theoretic framework to identify overlapping communities in social networks
In this paper, we introduce a game-theoretic framework to address the community detection problem based on the structures of social networks. We formulate the dynamics of community...
Wei Chen, Zhenming Liu, Xiaorui Sun, Yajun Wang
ATAL
2008
Springer
14 years 12 months ago
Emerging coordination in infinite team Markov games
In this paper we address the problem of coordination in multi-agent sequential decision problems with infinite statespaces. We adopt a game theoretic formalism to describe the int...
Francisco S. Melo, M. Isabel Ribeiro
WEA
2010
Springer
280views Algorithms» more  WEA 2010»
15 years 4 months ago
Practical Nearest Neighbor Search in the Plane
This paper shows that using some very simple practical assumptions, one can design an algorithm that finds the nearest neighbor of a given query point in O(log n) time in theory ...
Michael Connor, Piyush Kumar
QEST
2006
IEEE
15 years 4 months ago
Strategy Improvement for Concurrent Reachability Games
A concurrent reachability game is a two-player game played on a graph: at each state, the players simultaneously and independently select moves; the two moves determine jointly a ...
Krishnendu Chatterjee, Luca de Alfaro, Thomas A. H...