In this paper we study a game where every player is to choose a vertex (facility) in a given undirected graph. All vertices (customers) are then assigned to closest facilities and...
: Many natural games can have a dramatic difference between the quality of their best and worst Nash equilibria, even in pure strategies. Yet, nearly all work to date on dynamics s...
We consider wireless networks in which multiple paths are available between each source and destination. We allow each source to split traffic among all of its available paths, and...
Vinith Reddy, Srinivas Shakkottai, Alexander Sprin...
This paper describes a number of general design problems with adventure-like computer games for young children in order to demonstrate the need for specific design guidelines for t...
We find the winning strategy for a class of truncation games played on words. As a consequence of the present author’s recent results on some of these games we obtain new formul...