1 Quantum information technology Quantum information technology utilizes physical systems at the microscopic level, such as photon, atom, ion, and superconducting, to accomplish information-processing tasks that are i...1 Quantum information technology Quantum information technology utilizes physical systems at the microscopic level, such as photon, atom, ion, and superconducting, to accomplish information-processing tasks that are impossible for the classical macroscopic world. During the past decade, significant process has been achieved in the pursuit of quantum technology into practical applications,generating great research interest from various domains, with the potential to radically change our information infrastructure [1–3].展开更多
This paper designs a distributed algorithm to seek generalized Nash equilibria of a robust game with uncertain coupled constraints.Due to the uncertainty of parameters in set constraints,the authors aim to find a gene...This paper designs a distributed algorithm to seek generalized Nash equilibria of a robust game with uncertain coupled constraints.Due to the uncertainty of parameters in set constraints,the authors aim to find a generalized Nash equilibrium in the worst case.However,it is challenging to obtain the exact equilibria directly because the parameters are from general convex sets,which may not have analytic expressions or are endowed with high-dimensional nonlinearities.To solve this problem,the authors first approximate parameter sets with inscribed polyhedrons,and transform the approximate problem in the worst case into an extended certain game with resource allocation constraints by robust optimization.Then the authors propose a distributed algorithm for this certain game and prove that an equilibrium obtained from the algorithm induces anε-generalized Nash equilibrium of the original game,followed by convergence analysis.Moreover,resorting to the metric spaces and the analysis on nonlinear perturbed systems,the authors estimate the approximation accuracy related toεand point out the factors influencing the accuracy ofε.展开更多
This paper discusses a distributed design for clustering based on the K-means algorithm in a switching multi-agent network, for the case when data are decentralized stored and unavailable to all agents. The authors pr...This paper discusses a distributed design for clustering based on the K-means algorithm in a switching multi-agent network, for the case when data are decentralized stored and unavailable to all agents. The authors propose a consensus-based algorithm in distributed case, that is, the double- clock consensus-based K-means algorithm （DCKA）. With mild connectivity conditions, the authors show convergence of DCKA to guarantee a distributed solution to the clustering problem, even though the network topology is time-varying. Moreover, the authors provide experimental results on vari- ous clustering datasets to illustrate the effectiveness of the fully distributed algorithm DCKA, whose performance may be better than that of the centralized K-means algorithm.展开更多
A vector space structure is proposed for the set of finite games with fixed nmnbers of players and strategies for each players. Two statical equivalences are used to reduce tile dimension of finite games. Under the ve...A vector space structure is proposed for the set of finite games with fixed nmnbers of players and strategies for each players. Two statical equivalences are used to reduce tile dimension of finite games. Under the vector space structure the subspaces of exact and weighted potential games are investigated. Formulas are provided to calculate them. Then the finite evolutionary games （EGs） are considered. Strategy profile dynamics is obtained using different strategy updating rules （SURs）. Certain SURs, which assure the convergence of trajectories to pure Nash equilibriums, are investigated. Using the vector space structure, the projection of finite games to the subspace of exact （or weighted） potential games is considered, and a simple formula is given to calculate the projection. The convergence of near potential games to an c-equilibrium is studied. Further more, the Lyapunov function of EGs is defined and its application to the convergence of EGs is presented. Finally, the near potential function for an EG is defined, and it is proved that if the near potential function of an EG is a Lyapunov function, the EG will converge to a pure Nash equilibrium. Some examples are presented to illustrate the results.展开更多
基金supported by Shanghai Municipal Science and Technology Fundamental Project (Grant No. 21JC1405400)Shanghai Municipal Science and Technology Major Project (Grant No. 2021SHZDZX0100)。
文摘1 Quantum information technology Quantum information technology utilizes physical systems at the microscopic level, such as photon, atom, ion, and superconducting, to accomplish information-processing tasks that are impossible for the classical macroscopic world. During the past decade, significant process has been achieved in the pursuit of quantum technology into practical applications,generating great research interest from various domains, with the potential to radically change our information infrastructure [1–3].
基金supported partly by the National Key R&D Program of China under Grant No.2018YFA0703800the Strategic Priority Research Program of Chinese Academy of Sciences under Grant No.XDA27000000the National Natural Science Foundation of China under Grant Nos.61873262 and 61733018。
文摘This paper designs a distributed algorithm to seek generalized Nash equilibria of a robust game with uncertain coupled constraints.Due to the uncertainty of parameters in set constraints,the authors aim to find a generalized Nash equilibrium in the worst case.However,it is challenging to obtain the exact equilibria directly because the parameters are from general convex sets,which may not have analytic expressions or are endowed with high-dimensional nonlinearities.To solve this problem,the authors first approximate parameter sets with inscribed polyhedrons,and transform the approximate problem in the worst case into an extended certain game with resource allocation constraints by robust optimization.Then the authors propose a distributed algorithm for this certain game and prove that an equilibrium obtained from the algorithm induces anε-generalized Nash equilibrium of the original game,followed by convergence analysis.Moreover,resorting to the metric spaces and the analysis on nonlinear perturbed systems,the authors estimate the approximation accuracy related toεand point out the factors influencing the accuracy ofε.
基金supported by the National Key Research and Development Program of China under Grant No.2016YFB0901902the National Natural Science Foundation of China under Grant Nos.61573344,61333001,61733018,and 61374168
文摘This paper discusses a distributed design for clustering based on the K-means algorithm in a switching multi-agent network, for the case when data are decentralized stored and unavailable to all agents. The authors propose a consensus-based algorithm in distributed case, that is, the double- clock consensus-based K-means algorithm （DCKA）. With mild connectivity conditions, the authors show convergence of DCKA to guarantee a distributed solution to the clustering problem, even though the network topology is time-varying. Moreover, the authors provide experimental results on vari- ous clustering datasets to illustrate the effectiveness of the fully distributed algorithm DCKA, whose performance may be better than that of the centralized K-means algorithm.
基金supported partly by the National Natural Science Foundation of China under Grant Nos.61273013,61333001,61104065,and 61374168
文摘A vector space structure is proposed for the set of finite games with fixed nmnbers of players and strategies for each players. Two statical equivalences are used to reduce tile dimension of finite games. Under the vector space structure the subspaces of exact and weighted potential games are investigated. Formulas are provided to calculate them. Then the finite evolutionary games （EGs） are considered. Strategy profile dynamics is obtained using different strategy updating rules （SURs）. Certain SURs, which assure the convergence of trajectories to pure Nash equilibriums, are investigated. Using the vector space structure, the projection of finite games to the subspace of exact （or weighted） potential games is considered, and a simple formula is given to calculate the projection. The convergence of near potential games to an c-equilibrium is studied. Further more, the Lyapunov function of EGs is defined and its application to the convergence of EGs is presented. Finally, the near potential function for an EG is defined, and it is proved that if the near potential function of an EG is a Lyapunov function, the EG will converge to a pure Nash equilibrium. Some examples are presented to illustrate the results.
