108 search results - page 9 / 22 » Computing Approximate Nash Equilibria in Network Congestion ... |
SIGECOM
2005
ACM
14 years 8 days ago
2005
ACM
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
CDC
2010
IEEE
13 years 1 months ago
2010
IEEE
In this paper, we consider the development of single-timescale schemes for the distributed computation of Nash equilibria. In general, equilibria associated with convex Nash games ...
WINE
2007
Springer
14 years 24 days ago
2007
Springer
We present a computational approach to the saddle-point formulation for the Nash equilibria of two-person, zero-sum sequential games of imperfect information. The algorithm is a ...
ISAAC
2005
Springer
14 years 6 days ago
2005
Springer
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...