No-Regret Learning in Network Stochastic Zero-Sum Games
- 28 April 2026
- journal article
- research article
- Published by Springer Nature in Journal of Systems Science and Complexity
- Vol. 39 (2) , 831-856
Abstract
No abstract availableKeywords
All Related Versions
This publication has 22 references indexed in Scilit:
- Distributed Dynamic No-Regret Learning in Two-Network Zero-Sum GamesIEEE Transactions on Automatic Control, 2025
- No-Regret Distributed Learning in Subnetwork Zero-Sum GamesIEEE Transactions on Automatic Control, 2024
- Learning in games with continuous action sets and unknown payoff functionsMathematical Programming, 2018
- Stochastic Dual Averaging for Decentralized Online Optimization on Time-Varying Communication GraphsIEEE Transactions on Automatic Control, 2017
- Nash Equilibrium Computation in Subnetwork Zero-Sum Games With Switching CommunicationsIEEE Transactions on Automatic Control, 2015
- Heads-up limit hold’em poker is solvedScience, 2015
- Distributed convergence to Nash equilibria in two-network zero-sum gamesAutomatica, 2013
- Distributed Bregman-Distance Algorithms for Min-Max Optimization2013
- Constrained Consensus and Optimization in Multi-Agent NetworksIEEE Transactions on Automatic Control, 2010
- Adaptive Game Playing Using Multiplicative WeightsGames and Economic Behavior, 1999