130 search results - page 15 / 26 » Convergence Time to Nash Equilibria |
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE
Learning in many multi-agent settings is inherently repeated play. This calls into question the naive application of single play Nash equilibria in multi-agent learning and sugges...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
TIT
2008
13 years 7 months ago
2008
This paper considers the maximization of information rates for the Gaussian frequency-selective interference channel, subject to power and spectral mask constraints on each link. T...
SIGECOM
2010
ACM
13 years 7 months ago
2010
ACM
In the traditional voting manipulation literature, it is assumed that a group of manipulators jointly misrepresent their preferences to get a certain candidate elected, while the ...