Computation of Nash Equilibria: Admissibility of Parallel Gradient Descent
Journal of Optimization Theory and Applications, cilt.90, sa.1, ss.45-61, 1996 (Scopus)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası: 90 Sayı: 1
- Basım Tarihi: 1996
- Doi Numarası: 10.1007/bf02192245
- Dergi Adı: Journal of Optimization Theory and Applications
- Derginin Tarandığı İndeksler: Scopus
- Sayfa Sayıları: ss.45-61
- Anahtar Kelimeler: Multiple-objective optimization, Nash games, Parallel decision making, Practical algorithms
- Boğaziçi Üniversitesi Adresli: Evet
Özet
This paper offers some analytical results on the practical computation of Nash equilibria, which has been demonstrated to be relevant in real-world applications. In particular, the parallel gradient descent is analyzed from this perspective, and admissibility conditions are presented. First, the parallel gradient descent is defined in terms of update strategies and iteration times. It is shown that convergence is related to the contraction property. The analysis then derives sufficient conditions for the update strategies and the iteration times that ensure convergence. An illustrative example is presented in order to demonstrate practical implementation aspects and motivate the practical use of game theory in a wide spectrum of applications varying from economics to intelligent sensor systems.