Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
The designer's perspective to atomic noncooperative networks
IEEE/ACM Transactions on Networking (TON)
A Nash game algorithm for SIR-based power control in 3G wireless CDMA networks
IEEE/ACM Transactions on Networking (TON)
IEEE Transactions on Wireless Communications
Dynamics and stability in optical communication networks: a system theory framework
Automatica (Journal of IFAC)
IEEE Journal on Selected Areas in Communications - Part Supplement
A framework for uplink power control in cellular radio systems
IEEE Journal on Selected Areas in Communications
Dice: a game theoretic framework for wireless multipath network coding
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Games with coupled propagated constraints in optical networks with multi-link topologies
Automatica (Journal of IFAC)
Brief paper: A stability analysis with time-delay of primal-dual power control in optical links
Automatica (Journal of IFAC)
A Lyapunov-Krasovskii stability analysis for game-theoretic based power control in optical networks
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Games with coupled propagated constraints in general topology optical networks
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
An architectural view of game theoretic control
ACM SIGMETRICS Performance Evaluation Review
Proceedings of the Nineteenth International Workshop on Quality of Service
Cooperative distributed MPC of linear systems with coupled constraints
Automatica (Journal of IFAC)
Hi-index | 22.15 |
This paper extends some duality results from a standard optimization setup to a noncooperative (Nash) game framework. A Nash game (NG) with coupled constraints is considered. Solving directly such a coupled NG requires coordination among possibly all players. An alternative approach is proposed based on its relation to a special constrained optimization problem for the NG-game cost function, with respect to the second argument that admits a fixed-point solution. Specific separability properties of the NG-game cost are exploited and duality results are developed. This duality extension leads naturally to a hierarchical decomposition into a lower-level NG with no coupled constraints, and a higher-level system optimization problem. In the second part of the paper these theoretical results are applied to a coupled NG with coupled constraints as encountered in optical networks.