56 search results - page 7 / 12 » Penalty Methods for the Solution of Generalized Nash Equilib... |
ICCV
2009
IEEE
13 years 5 months ago
2009
IEEE
With this paper we offer a game-theoretic perspective for the all-pervasive matching problem in computer vision. Specifically, we formulate the matching problem as a (population) ...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—Channel assignment is a very important topic in wireless networks. In this paper, we study FDMA channel assignment in a non-cooperative wireless network, where devices are selď¬...
SIGECOM
2006
ACM
14 years 1 months ago
2006
ACM
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
SIGECOM
2011
ACM
12 years 10 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...
AMAI
2004
Springer
13 years 7 months ago
2004
Springer
Sequential von Neumann-Morgernstern (VM) games are a very general formalism for representing multi-agent interactions and planning problems in a variety of types of environments. ...