1,008 research outputs found
Continuous-time integral dynamics for Aggregative Game equilibrium seeking
In this paper, we consider continuous-time semi-decentralized dynamics for
the equilibrium computation in a class of aggregative games. Specifically, we
propose a scheme where decentralized projected-gradient dynamics are driven by
an integral control law. To prove global exponential convergence of the
proposed dynamics to an aggregative equilibrium, we adopt a quadratic Lyapunov
function argument. We derive a sufficient condition for global convergence that
we position within the recent literature on aggregative games, and in
particular we show that it improves on established results
Mean-Field-Type Games in Engineering
A mean-field-type game is a game in which the instantaneous payoffs and/or
the state dynamics functions involve not only the state and the action profile
but also the joint distributions of state-action pairs. This article presents
some engineering applications of mean-field-type games including road traffic
networks, multi-level building evacuation, millimeter wave wireless
communications, distributed power networks, virus spread over networks, virtual
machine resource management in cloud networks, synchronization of oscillators,
energy-efficient buildings, online meeting and mobile crowdsensing.Comment: 84 pages, 24 figures, 183 references. to appear in AIMS 201
Nash and Wardrop equilibria in aggregative games with coupling constraints
We consider the framework of aggregative games, in which the cost function of
each agent depends on his own strategy and on the average population strategy.
As first contribution, we investigate the relations between the concepts of
Nash and Wardrop equilibrium. By exploiting a characterization of the two
equilibria as solutions of variational inequalities, we bound their distance
with a decreasing function of the population size. As second contribution, we
propose two decentralized algorithms that converge to such equilibria and are
capable of coping with constraints coupling the strategies of different agents.
Finally, we study the applications of charging of electric vehicles and of
route choice on a road network.Comment: IEEE Trans. on Automatic Control (Accepted without changes). The
first three authors contributed equall
Tracking-based distributed equilibrium seeking for aggregative games
We propose fully-distributed algorithms for Nash equilibrium seeking in
aggregative games over networks. We first consider the case where local
constraints are present and we design an algorithm combining, for each agent,
(i) the projected pseudo-gradient descent and (ii) a tracking mechanism to
locally reconstruct the aggregative variable. To handle coupling constraints
arising in generalized settings, we propose another distributed algorithm based
on (i) a recently emerged augmented primal-dual scheme and (ii) two tracking
mechanisms to reconstruct, for each agent, both the aggregative variable and
the coupling constraint satisfaction. Leveraging tools from singular
perturbations analysis, we prove linear convergence to the Nash equilibrium for
both schemes. Finally, we run extensive numerical simulations to confirm the
effectiveness of our methods and compare them with state-of-the-art distributed
equilibrium-seeking algorithms
- …