294 search results - page 26 / 59 » The complexity of computing a Nash equilibrium |
104
click to vote
SIGECOM
2011
ACM
14 years 17 days 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...
ATAL
2003
Springer
15 years 3 months ago
2003
Springer
Auctions are useful mechanism for allocating items (goods, tasks, resources, etc.) in multiagent systems. The bulk of auction theory assumes that the bidders’ valuations for ite...
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
Video-based multiple target tracking (MTT) is a challenging task when similar targets are present in close vicinity. Because their visual observations are mixed and difficult to s...
SIGECOM
2006
ACM
15 years 3 months ago
2006
ACM
In multiagent systems, strategic settings are often analyzed under the assumption that the players choose their strategies simultaneously. However, this model is not always realis...
MP
2006
14 years 9 months ago
2006
We present a distribution-free model of incomplete-information games, both with and without private information, in which the players use a robust optimization approach to contend ...