Sciweavers

594 search results - page 43 / 119
» Games with Secure Equilibria
Sort
View
PE
2002
Springer
109views Optimization» more  PE 2002»
13 years 7 months ago
Non-cooperative routing in loss networks
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...
APPROX
2009
Springer
115views Algorithms» more  APPROX 2009»
14 years 2 months ago
Small Clique Detection and Approximate Nash Equilibria
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 ...
Lorenz Minder, Dan Vilenchik
PSD
2010
Springer
154views Database» more  PSD 2010»
13 years 6 months ago
Coprivacy: Towards a Theory of Sustainable Privacy
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...
Josep Domingo-Ferrer
ICC
2009
IEEE
148views Communications» more  ICC 2009»
14 years 2 months ago
A Game-Theoretic Analysis of Inter-Session Network Coding
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...
WAW
2010
Springer
311views Algorithms» more  WAW 2010»
13 years 5 months ago
Game-Theoretic Models of Information Overload in Social Networks
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,...