The paper studies routing in loss networks in the framework of a non-cooperative game with selfish users. Two solution concepts are considered: the Nash equilibrium, corresponding...
Eitan Altman, Rachid El Azouzi, Vyacheslav M. Abra...
Recently, Hazan and Krauthgamer showed [12] that if, for a fixed small ε, an ε-best ε-approximate Nash equilibrium can be found in polynomial time in two-player games, then it ...
We introduce the novel concept of coprivacy or co-operative privacy to make privacy preservation attractive. A protocol is coprivate if the best option for a player to preserve her...
Abstract— A common assumption in the network coding literature is that the users are cooperative and will not pursue their own interests. However, this assumption can be violated...
Amir Hamed Mohsenian Rad, Jianwei Huang, Vincent W...
We study the effect of information overload on user engagement in an asymmetric social network like Twitter. We introduce simple game-theoretic models that capture rate competition...
Christian Borgs, Jennifer T. Chayes, Brian Karrer,...