Sciweavers

224 search results - page 23 / 45
» On Nash-Equilibria of Approximation-Stable Games
Sort
View
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
14 years 24 days ago
Equilibria in topology control games for ad hoc networks
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust
ATAL
2008
Springer
13 years 9 months ago
Self-interested database managers playing the view maintenance game
A database view is a dynamic virtual table composed of the result set of a query, often executed over different underlying databases. The view maintenance problem concerns how a v...
Hala Mostafa, Victor R. Lesser, Gerome Miklau
CN
2011
127views more  CN 2011»
13 years 2 months ago
A game theoretic analysis of network design with socially-aware users
In many scenarios network design is not enforced by a central authority, but arises from the interactions of several self-interested agents. This is the case of the Internet, wher...
Jocelyne Elias, Fabio Martignon, Konstantin Avrach...
WIOPT
2010
IEEE
13 years 5 months ago
Routing games : From egoism to altruism
The paper studies the routing in the network shared by several users. Each user seeks to optimize either its own performance or some combination between its own performance and tha...
Amar Prakash Azad, Eitan Altman, Rachid El Azouzi
MOR
2008
94views more  MOR 2008»
13 years 7 months ago
Metastable Equilibria
We define a refinement of Nash equilibria called metastability. This refinement supposes that the given game might be embedded within any global game that leaves its local best-rep...
Srihari Govindan, Robert Wilson