9 citations · 47 across the 24 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
math.OC2022
No-Regret Learning in Network Stochastic Zero-Sum Games
Shijie Huang, Jinlong Lei, Yiguang Hong
No-regret learning has been widely used to compute a Nash equilibrium in two-person zero-sum games. However, there is still a lack of regret analysis for network stochastic zero-su…
math.OC2022
Distributed coordination for seeking the optimal Nash equilibrium of aggregative games
Xiaoyu Ma, Jinlong Lei, Peng Yi +1
This paper aims to design a distributed coordination algorithm for solving a multi-agent decision problem with a hierarchical structure. The primary goal is to search the Nash equi…
cs.LG2022
No-regret learning for repeated non-cooperative games with lossy bandits
Wenting Liu, Jinlong Lei, Peng Yi +1
This paper considers no-regret learning for repeated continuous-kernel games with lossy bandit feedback. Since it is difficult to give the explicit model of the utility functions i…