We consider the problem of computing -approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every > 0, but the reductions...
The abuse of online games by automated programs, known as game bots, for gaining unfair advantages has plagued millions of participating players with escalating severity in recent...
Steven Gianvecchio, Zhenyu Wu, Mengjun Xie, Hainin...
— In this paper, we propose a game theoretic approach to tackle the problem of the distributed formation of the hierarchical network architecture that connects the nodes in the u...
Ranking is necessary for multiplayer online games to provide players with self-complacence and reference for choosing game counterparts. Most existing ranking solutions are tightl...
Li Tang, Jun Li, Jin Zhou, Zhizhi Zhou, Hao Wang, ...
Many distributed systems can be modeled as network games: a collection of selfish players that communicate in order to maximize their individual utilities. The performance of such ...