Related papers: Distributed continuous-time strategy-updating rule…

We introduce a formalism modelling communication of distributed agents strictly in continuous-time. Within this framework, we study the problem of synthesising local strategies for individual agents such that a specified set of goal states…

We present a framework for computing approximate mixed-strategy Nash equilibria of continuous-action games. It is a modification of the traditional double oracle algorithm, extended to multiple players and continuous action spaces. Unlike…

We consider the problem of cooperation in distributed wireless networks of selfish and free transmitters aiming at maximizing their energy-efficiency. The strategy of each transmitter consists in choosing his power control (PC) policy. Two…

We study asynchronous dynamics in a network of interacting agents updating their binary states according to a time-varying threshold rule. Specifically, agents revise their state asynchronously by comparing the weighted average of the…

We study binary coordination games over graphs under log-linear learning when neighbor actions are conveyed through explicit noisy communication links. Each edge is modeled as either a binary symmetric channel (BSC) or a binary erasure…

Network congestion games are a convenient model for reasoning about routing problems in a network: agents have to move from a source to a target vertex while avoiding congestion, measured as a cost depending on the number of players using…

This paper addresses the problem of distributed online generalized Nash equilibrium (GNE) learning for multi-cluster games with delayed feedback information. Specifically, each agent in the game is assumed to be informed a sequence of local…

The distributed coordination problem of multi-agent systems is addressed in this paper under the assumption of intermittent communication between agents in the presence of time-varying communication delays. Specifically, we consider the…

This paper aims to accommodate games in which the players' dynamics are subject to un-modeled and disturbance terms. The un-modeled and disturbance terms are regarded as extended states for which observers are designed to estimate them.…

An extensive literature in economics and social science addresses contests, in which players compete to outperform each other on some measurable criterion, often referred to as a player's score, or output. Players incur costs that are an…

This paper investigates the communication strategy for second-order multi-agent systems with nonlinear dynamics. To save the scarce resources of communication channels, a novel event-triggered communication mechanism is designed without…

We study a target coverage problem in which a team of sensing agents, operating under limited communication, must collaboratively monitor targets that may be adaptively repositioned by an attacker. We model this interaction as a zero-sum…

This paper investigates Nash equilibrium (NE) seeking problems for noncooperative games over multi-players networks with finite bandwidth communication. A distributed quantized algorithm is presented, which consists of local gradient play,…

In practical applications, decision-makers with heterogeneous dynamics may be engaged in the same decision-making process. This motivates us to study distributed Nash equilibrium seeking for games in which players are mixed-order (first-…

In various online/offline multi-agent networked environments, it is very popular that the system can benefit from coordinating actions of two interacting agents at some cost of coordination. In this paper, we first formulate an optimization…

This paper designs a distributed stochastic annealing algorithm for non-convex cooperative aggregative games, whose agents' cost functions not only depend on agents' own decision variables but also rely on the sum of agents' decision…

In this paper, we present three distributed algorithms to solve a class of generalized Nash equilibrium (GNE) seeking problems in strongly monotone games. The first one (SD-GENO) is based on synchronous updates of the agents, while the…

Large scale systems are forecasted to greatly impact our future lives thanks to their wide ranging applications including cooperative robotics, mobility on demand, resource allocation, supply chain management. While technological…

We consider the distributed leader-follower consensus problem with event-triggered communications. The system under consideration is a non-linear input-affine multi agent system. The agents are assumed to have identical dynamics structure…

In this paper, we study multi-agent network games subject to affine time-varying coupling constraints and a time-varying communication network. We focus on the class of games adopting proximal dynamics and study their convergence to a…