Potential Games for Distributed Constrained Consensus

by   Dimitris Ampeliotis, et al.

The problem of computing a common point that lies in the intersection of a finite number of closed convex sets, each known to one agent in a network, is studied. This issue, known as the distributed convex feasibility problem or the distributed constrained consensus problem, constitutes an important research goal mainly due to the large number of possible applications. In this work, this issue is treated from a game theoretic viewpoint. In particular, we formulate the problem as a non-cooperative game for which a potential function exists and prove that all Nash equilibria of this game correspond to consensus states. Based upon this analysis, a best-response based distributed algorithm that solves the constrained consensus problem is developed. Furthermore, one more approach to solve the convex feasibility problem is studied based upon a projected gradient type algorithm that seeks the maximum of the considered potential function. A condition for the convergence of this scheme is derived and an exact distributed algorithm is given. Finally, simulation results for a source localization problem are given, that validate the theoretical results and demonstrate the applicability and performance of the derived algorithms.


page 1

page 2

page 3

page 4


Convex Decreasing Algorithms: Distributed Synthesis and Finite-time Termination in Higher Dimension

We introduce a general mathematical framework for distributed algorithms...

Gradient-Tracking over Directed Graphs for solving Leaderless Multi-Cluster Games

We are concerned with finding Nash Equilibria in agent-based multi-clust...

Time-varying constrained proximal type dynamics in multi-agent network games

In this paper, we study multi-agent network games subject to affine time...

Nash equilibrium seeking in potential games with double-integrator agents

In this paper, we show the equivalence between a constrained, multi-agen...

A Game Theoretical Analysis on the Gray-Wyner System and Generalised Common Information

We analyse the common information problem for the generalised Gray-Wyner...

On the robustness of equilibria in generalized aggregative games

We address the problem of assessing the robustness of the equilibria in ...

Distributed outer approximation of the intersection of ellipsoids

The outer Lowner-John method is widely used in sensor fusion application...

Please sign up or login with your details

Forgot password? Click here to reset