In this paper, we investigate a distributed Nash equilibrium computation problem for a time-varying multiagent network consisting of two subnetworks, where the two subnetworks share the same objective function. We first propose a subgradient-based distributed algorithm with heterogeneous stepsizes to compute a Nash equilibrium of a zero-sum game. We then prove that the proposed algorithm can achieve a Nash equilibrium under uniformly jointly strongly connected (UJSC) weight-balanced digraphs with homogenous stepsizes. Moreover, we demonstrate that for weighted-unbalanced graphs a Nash equilibrium may not be achieved with homogenous stepsizes unless certain conditions on the objective function hold. We show that there always exist heterogeneous stepsizes for the proposed algorithm to guarantee that a Nash equilibrium can be achieved for UJSC digraphs. Finally, in two standard weight-unbalanced cases, we verify the convergence to a Nash equilibrium by adaptively updating the stepsizes along with the arc weights in the proposed algorithm.
In this paper, we investigate source localization for wireless sensor networks based on received signal strength. We first formulate the localization problem as the intersection computation of a group of sensing rings, and then convert this non-convex problem into two weighted convex optimization problems. We next propose a unified distributed alternating projection algorithm to solve the resulting weighted optimization problems, where sensor nodes can communicate only locally with their neighbors over a time-varying jointly-connected topology. We also show that sensor nodes' estimates can achieve consensus on a possible minimizer. Both theoretical analysis and some comparative simulations reveal that the proposed approach has good estimation performance in both the consistent and inconsistent cases.
Abstract-This is a complete version of the 6-page IEEE TAC technical note [1]. In this paper, we consider the distributed surrounding of a convex target set by a group of agents with switching communication graphs. We propose a distributed controller to surround a given set with the same distance and desired projection angles specified by a complex-value adjacency matrix. Under mild connectivity assumptions, we give results in both consistent and inconsistent cases for the set surrounding in a plane. Also, we provide sufficient conditions for the multi-agent coordination when the convex set contains only the origin.
Privacy preservation is becoming an increasingly important issue in data mining and machine learning. In this paper, we consider the privacy preserving features of distributed subgradient optimization algorithms. We first show that a well-known distributed subgradient synchronous optimization algorithm, in which all agents make their optimization updates simultaneously at all times, is not privacy preserving in the sense that the malicious agent can learn other agents' subgradients asymptotically. Then we propose a distributed subgradient projection asynchronous optimization algorithm without relying on any existing privacy preservation technique, where agents can exchange data between neighbors directly. In contrast to synchronous algorithms, in the new asynchronous algorithm agents make their optimization updates asynchronously. The introduced projection operation and asynchronous optimization mechanism can guarantee that the proposed asynchronous optimization algorithm is privacy preserving. Moreover, we also establish the optimal convergence of the newly proposed algorithm. The proposed privacy preservation techniques shed light on developing other privacy preserving distributed optimization algorithms.
In this paper, we investigate the distributed shortest distance optimization problem for a multi-agent network to cooperatively minimize the sum of the quadratic distances from some convex sets, where each set is only associated with one agent. To deal with the optimization problem with projection uncertainties, we propose a distributed continuous-time dynamical protocol based on a new concept of approximate projection. Here each agent can only obtain an approximate projection point on the boundary of its convex set, and communicate with its neighbors over a time-varying communication graph. First, we show that no matter how large the approximate angle is, the system states are always bounded for any initial condition, and uniformly bounded with respect to all initial conditions if the inferior limit of the stepsize is greater than zero. Then, in the two cases, nonempty intersection and empty intersection of convex sets, we provide stepsize and approximate angle conditions to ensure the optimal convergence, respectively. Moreover, we give some characterizations about the optimal solutions for the empty intersection case and also present the convergence error between agents' estimates and the optimal point in the case of constant stepsizes and approximate angles.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.