224 search results - page 35 / 45 » On Nash-Equilibria of Approximation-Stable Games |
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
—We consider routing games where the performance of each user is dictated by the worst (bottleneck) element it employs. We are given a network, finitely many (selfish) users, eac...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— This paper proposes a distributed optimization framework for wireless multihop sensor networks base on a game theoretic approach. We show that the cross-layer optimization prob...
GAMESEC
2010
13 years 5 months ago
2010
Abstract. Even the most well-motivated models of information security have application limitations due to the inherent uncertainties involving risk. This paper exemplifies a formal...
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...
EPIA
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we analyze the convergence of independent adaptive learners in repeated games. We show that, in this class of games, independent adaptive learners converge to pure Na...