Lu Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Lu Wang has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
Chengzhi Xing
Zhongtai Securities Institute for Financial Studies, Shandong University, Jinan, China
1 shared publication- Xinwei Feng
Zhongtai Securities Institute for Financial Studies, Shandong University, Jinan, China
1 shared publication Zengjing Chen
Zhongtai Securities Institute for Financial Studies, Shandong University, Jinan, China
1 shared publication
Latest Publications
- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in Mathematical Control and Related Fields
- Vol. 14 (2) , 769-799
Stackelberg equilibrium with social optima in linear-quadratic-Gaussian mean-field system
A linear quadratic social optimal problem with a leader and a vast amount of weakly coupled followers is investigated in this paper. To be specific, the followers cooperate to minimize the social cost after the leader first announces his/her strategy, while the leader will then optimize his/her own cost functional on consideration of the followers' reactions. We assume that the controls are involved in both the followers' and the leader's state equations. Meanwhile, the followers' average control and average state terms enter into the drift term of the leader's state equation, reflecting that the leader's state is influenced by the followers' decisions and states. In order to obtain the asymptotic optimal strategies, two corresponding auxiliary problems are present using variational and person-by-person technologies. Furthermore, we construct the decentralized strategies for this leader-follower system by virtue of a solvable consistency condition system and the corresponding asymptotic Stackelberg equilibrium is demonstrated rigorously. Eventually, a numerical example is presented to illustrate the theoretical results.
- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in Mathematical Control and Related Fields
- Vol. 14 (2) , 769-799
Stackelberg equilibrium with social optima in linear-quadratic-Gaussian mean-field system
A linear quadratic social optimal problem with a leader and a vast amount of weakly coupled followers is investigated in this paper. To be specific, the followers cooperate to minimize the social cost after the leader first announces his/her strategy, while the leader will then optimize his/her own cost functional on consideration of the followers' reactions. We assume that the controls are involved in both the followers' and the leader's state equations. Meanwhile, the followers' average control and average state terms enter into the drift term of the leader's state equation, reflecting that the leader's state is influenced by the followers' decisions and states. In order to obtain the asymptotic optimal strategies, two corresponding auxiliary problems are present using variational and person-by-person technologies. Furthermore, we construct the decentralized strategies for this leader-follower system by virtue of a solvable consistency condition system and the corresponding asymptotic Stackelberg equilibrium is demonstrated rigorously. Eventually, a numerical example is presented to illustrate the theoretical results.
- Open Access
- 24 January 2023
- Published by Springer Nature in Scientific Reports
- Vol. 13 (1) , 1-11
Efficient dynamic channel assignment through laser chaos: a multiuser parallel processing learning algorithm
As laser chaos has been proven to be a robust tool to solve the multi-armed bandit (MAB) problem, this study investigates the problem of multiuser dynamic channel assignment using laser chaos in cognitive radio networks with K-orthogonal channels and M secondary users. A novel dynamic channel assignment algorithm with laser chaos series for multiple users, named parallel processing learning with laser chaos (PPL-LC) algorithm, is proposed to efficiently address two main objectives: stable channel assignment and fuzzy stable channel assignment. The latter objective accounts for the realistic scenario where users have fuzzy preferences and do not necessarily pursue the best preference. The PPL-LC algorithm uses the randomness properties of laser chaos to learn the assignment of channels to multiple users without any limitations on the number of channels, which has not been considered in existing laser chaos algorithms. Moreover, the PPL-LC is equipped with parallel processing channel selections, resulting in higher throughput and stronger adaptability with environmental changes over time than comparison algorithms, such as distributed stable strategy learning and coordinated stable marriage MAB algorithms. Finally, numerical examples are presented to demonstrate the performance of the PPL-LC algorithm.
- 24 January 2023
- Published by Springer Nature in Scientific Reports
- Vol. 13 (1) , 1-11
Open AccessEfficient dynamic channel assignment through laser chaos: a multiuser parallel processing learning algorithm
As laser chaos has been proven to be a robust tool to solve the multi-armed bandit (MAB) problem, this study investigates the problem of multiuser dynamic channel assignment using laser chaos in cognitive radio networks with K-orthogonal channels and M secondary users. A novel dynamic channel assignment algorithm with laser chaos series for multiple users, named parallel processing learning with laser chaos (PPL-LC) algorithm, is proposed to efficiently address two main objectives: stable channel assignment and fuzzy stable channel assignment. The latter objective accounts for the realistic scenario where users have fuzzy preferences and do not necessarily pursue the best preference. The PPL-LC algorithm uses the randomness properties of laser chaos to learn the assignment of channels to multiple users without any limitations on the number of channels, which has not been considered in existing laser chaos algorithms. Moreover, the PPL-LC is equipped with parallel processing channel selections, resulting in higher throughput and stronger adaptability with environmental changes over time than comparison algorithms, such as distributed stable strategy learning and coordinated stable marriage MAB algorithms. Finally, numerical examples are presented to demonstrate the performance of the PPL-LC algorithm.