374 search results - page 39 / 75 » Generalized Nash equilibrium problems |
136
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
This paper tackles the problem of how two selfish users jointly determine the operating point in the achievable rate region of a two-user Gaussian interference channel through barg...
168
click to vote
SIGECOM
2011
ACM
14 years 7 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
133
click to vote
CRYPTO
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We consider enhancing with privacy concerns a large class of auctions, which include sealed-bid single-item auctions but also general multi-item multi-winner auctions, ou...
130
click to vote
ESA
2009
Springer
15 years 11 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...
142
click to vote
SAGT
2009
Springer
15 years 10 months ago
2009
Springer
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of ...