56 search results - page 2 / 12 » Penalty Methods for the Solution of Generalized Nash Equilib... |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...
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 ...
CODES
2003
IEEE
14 years 5 days ago
2003
IEEE
In this paper, we describe a new methodology based on game theory for minimizing the average power of a circuit during scheduling in behavioral synthesis. The problem of schedulin...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In this paper we consider general rank minimization problems with rank appearing in either objective function or constraint. We first show that a class of matrix optimization prob...
TSP
2008
13 years 6 months ago
2008
In this two-part paper, we propose a decentralized strategy, based on a game-theoretic formulation, to find out the optimal precoding/multiplexing matrices for a multipoint-to-mult...