GB
Giuseppe Belgioioso
Authored
20 records found
Operationally-Safe Peer-to-Peer Energy Trading in Distribution Grids
A Game-Theoretic Market-Clearing Mechanism
In future distribution grids, prosumers (i.e., energy consumers with storage and/or production capabilities) will trade energy with each other and with the main grid. To ensure an efficient and safe operation of energy trading, in this paper, we formulate a peer-to-peer energy ma
...
Energy Management and Peer-to-peer Trading in Future Smart Grids
A Distributed Game-Theoretic Approach
We consider the economic dispatch problem for a day-ahead, peer-to-peer (P2P) electricity market of prosumers (i.e., energy consumers who can also produce electricity) in a distribution network. In our model, each prosumer has the capability of producing power through its dispatc
...
We address the generalized Nash equilibrium seeking problem for a population of agents playing aggregative games with affine coupling constraints. We focus on semi-decentralized communication architectures, where there is a central coordinator able to gather and broadcast signals
...
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 second and the third (AD-GEED and AD-GENO) r
...
We address the generalized Nash equilibrium seeking problem in a partial-decision information scenario, where each agent can only exchange information with some neighbors, although its cost function possibly depends on the strategies of all agents. The few existing methods build
...
We address the demand-side management (DSM) problem for smart grids where the users have energy generation and storage capabilities, and where the energy price depends on the renewable energy sources and on the aggregate electricity demand. Each user aims at reducing its economic
...
In this article, we study proximal type dynamics in the context of multiagent network games. We analyze several conjugations of this class of games, providing convergence results. Specifically, we look into synchronous/asynchronous dynamics with time-invariant communication netwo
...
In this article, we study proximal type dynamics in the context of multiagent network games. We analyze several conjugations of this class of games, providing convergence results. Specifically, we look into synchronous/asynchronous dynamics with time-invariant communication netwo
...
We design the first fully distributed algorithm for generalized Nash equilibrium seeking in aggregative games on a time-varying communication network, under partial-decision information, i.e., the agents have no direct access to the aggregate decision. The algorithm is derived by
...
We address the Nash equilibrium problem in a partial-decision information scenario, where each agent can only observe the actions of some neighbors, while its cost possibly depends on the strategies of other agents. Our main contribution is the design of a fully-distributed, sing
...
We address the generalized Nash equilibrium seeking problem for a population of noncooperative agents playing potential games with linear coupling constraints over a communication network. We consider a class of generalized potential games where the coupling in the cost functions
...
We address the generalized Nash equilibrium seeking problem for a population of noncooperative agents playing potential games with linear coupling constraints over a communication network. We consider a class of generalized potential games where the coupling in the cost functions
...
State convergence is essential in many scientific areas, e.g. multi-agent consensus/disagreement, distributed optimization, computational game theory, multi-agent learning over networks. In this paper, we study for the first time the state convergence problem in uncertain linear
...
State convergence is essential in many scientific areas, e.g. multi-agent consensus/disagreement, distributed optimization, computational game theory, multi-agent learning over networks. In this paper, we study for the first time the state convergence problem in uncertain linear
...
We design a distributed algorithm for generalized Nash equilibrium seeking in aggregative games with linear coupling constraints under partial-decision information, i.e., the agents have no direct access to the aggregate decision. The algorithm is derived by including dynamic tra
...
In this paper, we propose an asynchronous distributed algorithm for the computation of generalized Nash equilibria in noncooperative games, where the players interact via an undirected communication graph. Specifically, we extend the paper 'Asynchronous distributed algorithm for
...
In this paper, we propose an asynchronous distributed algorithm for the computation of generalized Nash equilibria in noncooperative games, where the players interact via an undirected communication graph. Specifically, we extend the paper 'Asynchronous distributed algorithm for
...
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 persistent equilibrium. The assumptions consi
...
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 persistent equilibrium. The assumptions consi
...
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 persistent equilibrium. The assumptions consi
...