This paper studies the distributed Nash equilibrium seeking(DNES)problem for games whose action sets are compact and whose network graph is switching satisfying the jointly strongly connected condition.To keep the act...This paper studies the distributed Nash equilibrium seeking(DNES)problem for games whose action sets are compact and whose network graph is switching satisfying the jointly strongly connected condition.To keep the actions of all players in their action sets all the time,one has to resort to the projected gradient-based method.Under the assumption that the unique Nash equilibrium is the unique equilibrium of the pseudogradient system,an algorithm is proposed that is able to exponentially find the Nash equilibrium.Further,the authors also consider the distributed Nash equilibrium seeking problem for games whose actions are governed by high-order integrator dynamics and belong to some compact sets.Two examples are used to illustrate the proposed approach.展开更多
The set of finite group actions (up to equivalence) which operate on a prism manifold M, preserve a Heegaard Klein bottle and have a fixed orbifold quotient type, form a partially ordered set. We describe the partial ...The set of finite group actions (up to equivalence) which operate on a prism manifold M, preserve a Heegaard Klein bottle and have a fixed orbifold quotient type, form a partially ordered set. We describe the partial ordering of these actions by relating them to certain sets of ordered pairs of integers. There are seven possible orbifold quotient types, and for any fixed quotient type we show that the partially ordered set is isomorphic to a union of distributive lattices of a certain type. We give necessary and sufficent conditions, for these partially ordered sets to be isomorphic and to be a union of Boolean algebras.展开更多
基金supported in part by the Research Grants Council of the Hong Kong Special Administration Region under Grant No.14202619in part by the National Natural Science Foundation of China under Grant No.61973260。
文摘This paper studies the distributed Nash equilibrium seeking(DNES)problem for games whose action sets are compact and whose network graph is switching satisfying the jointly strongly connected condition.To keep the actions of all players in their action sets all the time,one has to resort to the projected gradient-based method.Under the assumption that the unique Nash equilibrium is the unique equilibrium of the pseudogradient system,an algorithm is proposed that is able to exponentially find the Nash equilibrium.Further,the authors also consider the distributed Nash equilibrium seeking problem for games whose actions are governed by high-order integrator dynamics and belong to some compact sets.Two examples are used to illustrate the proposed approach.
文摘The set of finite group actions (up to equivalence) which operate on a prism manifold M, preserve a Heegaard Klein bottle and have a fixed orbifold quotient type, form a partially ordered set. We describe the partial ordering of these actions by relating them to certain sets of ordered pairs of integers. There are seven possible orbifold quotient types, and for any fixed quotient type we show that the partially ordered set is isomorphic to a union of distributive lattices of a certain type. We give necessary and sufficent conditions, for these partially ordered sets to be isomorphic and to be a union of Boolean algebras.
