374 search results - page 3 / 75 » Generalized Nash equilibrium problems |
WINE
2009
Springer
13 years 10 months ago
2009
Springer
This paper deals with two games defined upon well known generalizations of max cut. We study the existence of a strong equilibrium which is a refinement of the Nash equilibrium. ...
SIROCCO
2004
13 years 7 months ago
2004
The problem of routing traffic through a congested network is studied. The framework is that introduced by Koutsoupias and Papadimitriou where the network is constituted by m paral...
STOC
2006
ACM
14 years 6 months ago
2006
ACM
In this paper, we improve a recent result of Daskalakis, Goldberg and Papadimitriou on PPAD-completeness of 4-Nash, showing that 3-Nash is PPAD-complete.
JSAC
2008
13 years 6 months ago
2008
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
MST
2010
13 years 4 months ago
2010
In this work, we continue the study of the many facets of the Fully Mixed Nash Equilibrium Conjecture, henceforth abbreviated as the FMNE Conjecture, in selfish routing for the s...