108 search results - page 8 / 22 » Computing Approximate Nash Equilibria in Network Congestion ... |
ESA
2009
Springer
14 years 1 months ago
2009
Springer
We consider a process called Group Network Formation Game, which represents the scenario when strategic agents are building a network together. In our game, agents can have extrem...
WINE
2007
Springer
14 years 24 days ago
2007
Springer
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
CDC
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract— Generalized Nash equilibria (GNE) represent extensions of the Nash solution concept when agents have shared strategy sets. This generalization is particularly relevant ...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
We present several new characterizations of correlated equilibria in games with continuous utility functions. These have the advantage of being more computationally and analytical...
IPTPS
2004
Springer
14 years 2 days ago
2004
Springer
In P2P systems, users often have many choices of peers from whom to download their data. Each user cares primarily about its own response time, which depends on how many other use...