60 search results - page 11 / 12 » Algorithms for pure Nash equilibria in weighted congestion g... |
SIGECOM
2010
ACM
13 years 6 months ago
2010
ACM
In the traditional voting manipulation literature, it is assumed that a group of manipulators jointly misrepresent their preferences to get a certain candidate elected, while the ...
WAW
2010
Springer
13 years 3 months ago
2010
Springer
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...
SODA
2012
ACM
11 years 8 months ago
2012
ACM
A Nash Equilibrium is a joint strategy profile at which each agent myopically plays a best response to the other agents’ strategies, ignoring the possibility that deviating fro...
WINE
2005
Springer
13 years 11 months ago
2005
Springer
We propose a simple and intuitive cost mechanism which assigns costs for the competitive usage of m resources by n selfish agents. Each agent has an individual demand; demands are...
SAGA
2007
Springer
13 years 12 months ago
2007
Springer
We consider applications of probabilistic techniques in the framework of algorithmic game theory. We focus on three distinct case studies: (i) The exploitation of the probabilistic...