294 search results - page 20 / 59 » The complexity of computing a Nash equilibrium |
132
Voted
WINE
2005
Springer
15 years 9 months ago
2005
Springer
We propose a simple and intuitive cost mechanism which assigns costs for the competitive usage of m resources by n selfish agents. Each agent has an individual demand; demands are...
107
Voted
SIGECOM
2005
ACM
15 years 9 months 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...
114
Voted
FCT
2005
Springer
15 years 9 months ago
2005
Springer
155
Voted
TCS
2010
14 years 10 months ago
2010
We consider network congestion problems between TCP flows and define a new game, the Window-game, which models the problems of network congestion caused by the competing flows. An...
122
Voted
WINE
2007
Springer
15 years 9 months 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 ...