Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Xu, Gehui"'
Autor:
Xu, Gehui, Chen, Guanpu, Fidan, Baris, Hong, Yiguang, Qi, Hongsheng, Parisini, Thomas, Johansson, Karl H.
Sensor network localization (SNL) is a challenging problem due to its inherent non-convexity and the effects of noise in inter-node ranging measurements and anchor node position. We formulate a non-convex SNL problem as a multi-player non-convex pote
Externí odkaz:
http://arxiv.org/abs/2407.04608
Autor:
Chen, Guanpu, Xu, Gehui, He, Fengxiang, Tao, Dacheng, Parisini, Thomas, Johansson, Karl Henrik
In this note, we investigate the robustness of Nash equilibria (NE) in multi-player aggregative games with coupling constraints. There are many algorithms for computing an NE of an aggregative game given a known aggregator. When the coupling paramete
Externí odkaz:
http://arxiv.org/abs/2403.10980
Consider a sensor network consisting of both anchor and non-anchor nodes. We address the following sensor network localization (SNL) problem: given the physical locations of anchor nodes and relative measurements among all nodes, determine the locati
Externí odkaz:
http://arxiv.org/abs/2401.02471
Sensor network localization (SNL) problems require determining the physical coordinates of all sensors in a network. This process relies on the global coordinates of anchors and the available measurements between non-anchor and anchor nodes. Attribut
Externí odkaz:
http://arxiv.org/abs/2311.03326
Wide machine learning tasks can be formulated as non-convex multi-player games, where Nash equilibrium (NE) is an acceptable solution to all players, since no one can benefit from changing its strategy unilaterally. Attributed to the non-convexity, o
Externí odkaz:
http://arxiv.org/abs/2301.08015
There has been significant recent interest in leader-follower security games, where the leader dominates the decision process with the Stackelberg equilibrium (SE) strategy. However, such a leader-follower scheme may become invalid in practice due to
Externí odkaz:
http://arxiv.org/abs/2210.15928
We design 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, we aim to find a generalized Nash equilibrium in the worst case. Howev
Externí odkaz:
http://arxiv.org/abs/2204.01548
In this paper, we aim to design a distributed approximate algorithm for seeking Nash equilibria of an aggregative game. Due to the local set constraints of each player, projectionbased algorithms have been widely employed for solving such problems ac
Externí odkaz:
http://arxiv.org/abs/2108.12142
To solve distributed optimization efficiently with various constraints and nonsmooth functions, we propose a distributed mirror descent algorithm with embedded Bregman damping, as a generalization of conventional distributed projection-based algorith
Externí odkaz:
http://arxiv.org/abs/2108.12136
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.