Abstract
This paper considers a class of generalized convex games where each player is associated with a convex objective function, a private convex inequality constraint and a private convex constraint set. The component functions are potentially non-smooth. The players aim to compute a Nash equilibrium through communicating with neighboring players. We study two distributed computation algorithms and show their convergence properties in the presence of data transmission delays and dynamic changes of network topologies.
Original language | English (US) |
---|---|
Article number | 6426369 |
Pages (from-to) | 4858-4863 |
Number of pages | 6 |
Journal | Proceedings of the IEEE Conference on Decision and Control |
DOIs | |
State | Published - Dec 1 2012 |
Event | 51st IEEE Conference on Decision and Control, CDC 2012 - Maui, HI, United States Duration: Dec 10 2012 → Dec 13 2012 |
All Science Journal Classification (ASJC) codes
- Control and Systems Engineering
- Modeling and Simulation
- Control and Optimization