For the unbiased Maker-Breaker game, played on the hypergraph H, let τM (H) be the smallest integer t such that Maker can win the game within t moves (if the game is a Breaker’...
Dan Hefetz, Michael Krivelevich, Milos Stojakovic,...
Pervasive games provide a new type of game combining new technologies with the real environment of the players. While this already poses new challenges to the game developer, requ...
Wolfgang Broll, Jan Ohlenburg, Irma Lindt, Iris He...
In this position paper we propose an evaluation framework for networked mobile gaming, consisting of user, group, communication, and environment models. Each of these components a...
A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions specified as Ra...
We study the interaction among users of unstructured file sharing applications, who compete for available network resources (link bandwidth or capacity) by opening multiple conne...
Honggang Zhang, Giovanni Neglia, Donald F. Towsley...