Jong-Shi Pang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jong-Shi Pang has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Daniel Pérez Palomar
Hong Kong University of Science and Technology (HKUST), Kowloon, Hong Kong
2 shared publications - Francisco Facchinei
Sapienza University of Rome
2 shared publications - Gesualdo Scutari
State University of New York (SUNY) at Buffalo
2 shared publications Jing Hu
Market Analytics, Inc
1 shared publication- John E. Mitchell
Math. Sci., Rensselaer Polytechnic Institute
1 shared publication - Lanshan Han
University of Illinois at Urbana-Champaign
1 shared publication
Latest Publications
- Open Access
Real and Complex Monotone Communication Games
Noncooperative game-theoretic tools have been increasingly used to study many important resource allocation problems in communications, networking, smart grids, and portfolio optimization. In this paper, we consider a general class of convex Nash Equilibrium Problems (NEPs), where each player aims to solve an arbitrary smooth convex optimization problem. Differently from most of current works, we do not assume any specific structure for the players' problems, and we allow the optimization variables of the players to be matrices in the complex domain. Our main contribution is the design of a novel class of distributed (asynchronous) best-response- algorithms suitable for solving the proposed NEPs, even in the presence of multiple solutions. The new methods, whose convergence analysis is based on Variational Inequality (VI) techniques, can select, among all the equilibria of a game, those that optimize a given performance criterion, at the cost of limited signaling among the players. This is a major departure from existing best-response algorithms, whose convergence conditions imply the uniqueness of the NE. Some of our results hinge on the use of VI problems directly in the complex domain; the study of these new kind of VIs also represents a noteworthy innovative contribution. We then apply the developed methods to solve some new generalizations of SISO and MIMO games in cognitive radios and femtocell systems, showing a considerable performance improvement over classical pure noncooperative schemes.
Open AccessReal and Complex Monotone Communication Games
Noncooperative game-theoretic tools have been increasingly used to study many important resource allocation problems in communications, networking, smart grids, and portfolio optimization. In this paper, we consider a general class of convex Nash Equilibrium Problems (NEPs), where each player aims to solve an arbitrary smooth convex optimization problem. Differently from most of current works, we do not assume any specific structure for the players' problems, and we allow the optimization variables of the players to be matrices in the complex domain. Our main contribution is the design of a novel class of distributed (asynchronous) best-response- algorithms suitable for solving the proposed NEPs, even in the presence of multiple solutions. The new methods, whose convergence analysis is based on Variational Inequality (VI) techniques, can select, among all the equilibria of a game, those that optimize a given performance criterion, at the cost of limited signaling among the players. This is a major departure from existing best-response algorithms, whose convergence conditions imply the uniqueness of the NE. Some of our results hinge on the use of VI problems directly in the complex domain; the study of these new kind of VIs also represents a noteworthy innovative contribution. We then apply the developed methods to solve some new generalizations of SISO and MIMO games in cognitive radios and femtocell systems, showing a considerable performance improvement over classical pure noncooperative schemes.
- 9 November 2010
- Published by Springer Nature in Mathematical Programming
- Vol. 133 (1-2) , 243-277
An LPCC approach to nonconvex quadratic programs
- 9 November 2010
- Published by Springer Nature in Mathematical Programming
- Vol. 133 (1-2) , 243-277
An LPCC approach to nonconvex quadratic programs
- Open Access
- 11 March 2009
- Published by Springer Nature in Computational Management Science
- Vol. 6 (3) , 373-375
Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games
- 11 March 2009
- Published by Springer Nature in Computational Management Science
- Vol. 6 (3) , 373-375
Open AccessQuasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games
- 28 May 2008
- Published by Springer Nature in Mathematical Programming
- Vol. 121 (1) , 171-199
Non-Zenoness of a class of differential quasi-variational inequalities
- 28 May 2008
- Published by Springer Nature in Mathematical Programming
- Vol. 121 (1) , 171-199
Non-Zenoness of a class of differential quasi-variational inequalities
- 19 May 2008
- Published by Wiley in ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik
- Vol. 88 (6) , 454-471
Frictional contact models with local compliance: semismooth formulation
- 19 May 2008
- Published by Wiley in ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik
- Vol. 88 (6) , 454-471
Frictional contact models with local compliance: semismooth formulation