170 search results - page 20 / 34 » Parallel Computation of Nash Equilibria in N-Player Games |
CORR
2008
Springer
13 years 7 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...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We study the existence and tractability of a notion of approximate equilibria in bimatrix games, called well supported approximate Nash Equilibria (SuppNE in short). We p...
STACS
2007
Springer
14 years 1 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...
JAIR
2011
12 years 10 months ago
2011
There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game mo...
PE
2002
Springer
13 years 7 months ago
2002
Springer
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...