TY - JOUR
T1 - Nash equilibrium problems with scaled congestion costs and shared constraints
AU - Yin, Huibing
AU - Shanbhag, Uday V.
AU - Mehta, Prashant G.
N1 - Funding Information:
Manuscript received April 16, 2009; revised February 07, 2010, August 24, 2010; accepted February 18, 2011. Date of publication April 05, 2011; date of current version July 07, 2011. This work was supported by National Science Foundation (NSF) Award CCF-072886. Recommended by Associate Editor P. Tsiotras.
PY - 2011/7
Y1 - 2011/7
N2 - We consider a class of convex Nash games where strategy sets are coupled across agents through a common constraint and payoff functions are linked via a scaled congestion cost metric. A solution to a related variational inequality problem provides a set of Nash equilibria characterized by common Lagrange multipliers for shared constraints. While this variational problem may be characterized by a non-monotone map, it is shown to admit solutions, even in the absence of restrictive compactness assumptions on strategy sets. Additionally, we show that the equilibrium is locally unique both in the primal space as well as in the larger primal-dual space. The existence statements can be generalized to accommodate a piecewise-smooth congestion metric while affine restrictions, surprisingly, lead to both existence and global uniqueness guarantees. In the second part of the technical note, we discuss distributed computation of such equilibria in monotone regimes via a distributed iterative Tikhonov regularization (ITR) scheme. Application to a class of networked rate allocation games suggests that the ITR schemes perform better than their two-timescale counterparts.
AB - We consider a class of convex Nash games where strategy sets are coupled across agents through a common constraint and payoff functions are linked via a scaled congestion cost metric. A solution to a related variational inequality problem provides a set of Nash equilibria characterized by common Lagrange multipliers for shared constraints. While this variational problem may be characterized by a non-monotone map, it is shown to admit solutions, even in the absence of restrictive compactness assumptions on strategy sets. Additionally, we show that the equilibrium is locally unique both in the primal space as well as in the larger primal-dual space. The existence statements can be generalized to accommodate a piecewise-smooth congestion metric while affine restrictions, surprisingly, lead to both existence and global uniqueness guarantees. In the second part of the technical note, we discuss distributed computation of such equilibria in monotone regimes via a distributed iterative Tikhonov regularization (ITR) scheme. Application to a class of networked rate allocation games suggests that the ITR schemes perform better than their two-timescale counterparts.
UR - http://www.scopus.com/inward/record.url?scp=79960111606&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79960111606&partnerID=8YFLogxK
U2 - 10.1109/TAC.2011.2137590
DO - 10.1109/TAC.2011.2137590
M3 - Article
AN - SCOPUS:79960111606
SN - 0018-9286
VL - 56
SP - 1702
EP - 1708
JO - IEEE Transactions on Automatic Control
JF - IEEE Transactions on Automatic Control
IS - 7
M1 - 5742685
ER -