| Paper: | SPCOM-P2.1 | ||
| Session: | Resource Allocation (MAC and Scheduling) | ||
| Time: | Tuesday, May 16, 10:30 - 12:30 | ||
| Presentation: | Poster | ||
| Topic: | Signal Processing for Communication: Power control, resource management, system level optimization | ||
| Title: | POTENTIAL GAMES: A FRAMEWORK FOR VECTOR POWER CONTROL PROBLEMS WITH COUPLED CONSTRAINTS | ||
| Authors: | Gesualdo Scutari, Sergio Barbarossa, Universitá degli Studi di Roma "La Sapienza", Italy; Daniel P. Palomar, Princeton University, United States | ||
| Abstract: | In this paper we propose a unified framework, based on the emergent potential games to deal with a variety of network resource allocation problems. We generalize the existing results on potential games to the cases where there exists coupling among the (possibly vector) strategies of all players. We derive sufficient conditions for the existence and uniqueness of the Nash Equilibrium, and provide different distributed algorithms along their convergence properties. Using this new framework, we then show that many power control problems (standard and non-standard) with coupling constraints among the users, can be naturally formulated as potential games and, hence, efficiently solved. Finally, we point out that an interesting interplay existing between potential games, classical optimization theory, and Lyapunov stability theory. | ||
©2018 Conference Management Services, Inc. -||- email: webmaster@icassp2006.org -||- Last updated Friday, August 17, 2012