Online Distributed Algorithms for Online Noncooperative Games With Stochastic Cost Functions: High Probability Bound of Regrets
IEEE Transactions on Automatic Control · 2024-12 · 69 (12) · 8860-8867
DOI: 10.1109/tac.2024.3419018 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Automatic Control, 2024-12. Verfasst von Kaihong Lu. Die Arbeit wurde bisher 45-mal zitiert (Crossref) und nennt 34 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Natural Science Foundation of Shandong Province, High-level Talent Team Project of Qingdao West Coast New Area.
Abstract (Originalsprache)
In this article, online noncooperative games without full decision information are studied, where the goal of players is to seek the Nash equilibria in a distributed manner. Different from the existing works on online noncooperative games, here we consider the case where the cost functions are stochastic. In the problem, each player only has access to a noisy gradient of its own cost function and a local action set, and needs to make decisions before the current noisy gradient information is revealed. To handle this problem, we propose an online distributed stochastic mirror descent algorithm. The performance of the presented algorithm is measured by employing the dynamic regrets, where the offline benchmarks are to seek the Nash equilibrium point at each time. Particularly, a high probability bound of the dynamic regrets is proposed on the basis of the sub-Gaussian noise model. The result shows that if the variation in the Nash equilibrium sequence grows at a certain rate, then the regrets increase sublinearly with a high probability. Finally, simulations are worked out to demonstrate the effectiveness of our theoretical results.
Förderung
- National Natural Science Foundation of China
- Natural Science Foundation of Shandong Province
- High-level Talent Team Project of Qingdao West Coast New Area
Zitieren
APA
Lu, K. (2024). Online Distributed Algorithms for Online Noncooperative Games With Stochastic Cost Functions: High Probability Bound of Regrets. IEEE Transactions on Automatic Control, 69(12), 8860-8867. https://doi.org/10.1109/tac.2024.3419018
Vancouver
Lu K. Online Distributed Algorithms for Online Noncooperative Games With Stochastic Cost Functions: High Probability Bound of Regrets. IEEE Transactions on Automatic Control. 2024;69(12):8860-8867. doi:10.1109/tac.2024.3419018
BibTeX
@article{Lu2024,
author = {Lu, Kaihong},
title = {Online Distributed Algorithms for Online Noncooperative Games With Stochastic Cost Functions: High Probability Bound of Regrets},
journal = {IEEE Transactions on Automatic Control},
year = {2024},
volume = {69},
number = {12},
pages = {8860--8867},
doi = {10.1109/tac.2024.3419018}
}
EUVIMED