We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
Multiplayer online games have become very popular in recent years. However, they generally suffer from network latency problem. If a player changes its states, it will take some ...
Frederick W. B. Li, Lewis W. F. Li, Rynson W. H. L...
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
Massively Multiplayer Online Games (MMOGs) are an increasingly popular class of real-time interactive distributed applications that require scalable architectures and parallelizat...
We propose two unstructured file sharing games, unilateral and bilateral unstructured file sharing games, to study the interaction among self-interested players (users) of unstruct...
Honggang Zhang, Giovanni Neglia, Donald F. Towsley...