108 search results - page 1 / 22 » -Hardness of Pure Nash Equilibrium in Scheduling and Connect... |
109
Voted
AAAI
2007
15 years 2 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...
106
Voted
AAAI
2010
15 years 1 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...
108
Voted
STACS
2007
Springer
15 years 6 months ago
2007
Springer
Strategic games may exhibit symmetries in a variety of ways. A characteristic feature, enabling the compact representation of games even when the number of players is unbounded, i...
100
Voted
CORR
2008
Springer
15 years 10 days 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...
JSAC
2008
15 years 6 days 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...