Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
WINE
2010
Springer
251views Economy» more  WINE 2010»
11 years 3 months ago
The Complexity of Equilibria in Cost Sharing Games
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...
Vasilis Syrgkanis
JAIR
2010
97views more  JAIR 2010»
11 years 3 months ago
Mixed Strategies in Combinatorial Agency
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...
Moshe Babaioff, Michal Feldman, Noam Nisan
JSAC
2008
115views more  JSAC 2008»
11 years 5 months ago
A Game-Theoretical Study of Robust Networked Systems
This paper analyses the robustness of networked systems from a game-theoretical perspective. Networked systems often consist of several subsystems sharing resources interdependentl...
Chi-Kin Chau
CORR
2008
Springer
174views Education» more  CORR 2008»
11 years 5 months ago
Bounded Budget Connection (BBC) Games or How to make friends and influence people, on a budget
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...
Nikolaos Laoutaris, Laura J. Poplawski, Rajmohan R...
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
11 years 5 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
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....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
AAAI
2010
11 years 6 months ago
Private and Third-Party Randomization in Risk-Sensitive Equilibrium Concepts
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...
Mickey Brautbar, Michael Kearns, Umar Syed
AAAI
2007
11 years 7 months ago
The Impact of Network Topology on Pure Nash Equilibria in Graphical Games
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...
Bistra N. Dilkina, Carla P. Gomes, Ashish Sabharwa...
ICALP
2003
Springer
11 years 10 months ago
Convergence Time to Nash Equilibria
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...
Eyal Even-Dar, Alexander Kesselman, Yishay Mansour
WINE
2005
Springer
179views Economy» more  WINE 2005»
11 years 10 months ago
A Graph-Theoretic Network Security Game
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...
Marios Mavronicolas, Vicky G. Papadopoulou, Anna P...
FOCS
2007
IEEE
11 years 11 months ago
Computing Equilibria in Anonymous Games
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...
Constantinos Daskalakis, Christos H. Papadimitriou
books