WINE
2010
Springer
13 years 2 months ago
2010
Springer
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...
JAIR
2010
13 years 3 months ago
2010
We study a setting where a principal needs to motivate a team of agents whose combination of hidden efforts stochastically determines an outcome. In a companion paper we devise an...
JSAC
2008
13 years 5 months ago
2008
This paper analyses the robustness of networked systems from a game-theoretical perspective. Networked systems often consist of several subsystems sharing resources interdependentl...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Motivated by applications in social networks, peer-to-peer and overlay networks, we define and study the Bounded Budget Connection (BBC) game - we have a collection of n players o...
SIGECOM
2010
ACM
13 years 5 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
AAAI
2010
13 years 6 months ago
2010
We consider risk-sensitive generalizations of Nash and correlated equilibria in noncooperative games. We prove that, except for a class of degenerate games, unless a two-player ga...
AAAI
2007
13 years 7 months ago
2007
Graphical games capture some of the key aspects relevant to the study and design of multi-agent systems. It is often of interest to find the conditions under which a game is stab...
ICALP
2003
Springer
13 years 10 months ago
2003
Springer
We study the number of steps required to reach a pure Nash Equilibrium in a load balancing scenario where each job behaves selfishly and attempts to migrate to a machine which will...
WINE
2005
Springer
13 years 10 months ago
2005
Springer
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
We present efficient approximation algorithms for finding Nash equilibria in anonymous games, that is, games in which the players utilities, though different, do not differentia...