337 citations · 1.7k across the 25 of their papers we have counts for
27 papers
Recursive Reasoning in Minimax Games: A Level Gradient Play Method
Zichu Liu, Lacra Pavel
Despite the success of generative adversarial networks (GANs) in generating visually appealing images, they are notoriously challenging to train. In order to stabilize the learning…
Second-Order Mirror Descent: Convergence in Games Beyond Averaging and Discounting
Bolin Gao, Lacra Pavel
In this paper, we propose a second-order extension of the continuous-time game-theoretic mirror descent (MD) dynamics, referred to as MD2, which provably converges to mere (but not…
An inexact-penalty method for GNE seeking in games with dynamic agents
Andrew R. Romano, Lacra Pavel
We consider a network of autonomous agents whose outputs are actions in a game with coupled constraints. In such network scenarios, agents seeking to minimize coupled cost function…
On the exact convergence to Nash equilibrium in hypomonotone regimes under full and partial-information
Dian Gadjov, Lacra Pavel
In this paper, we consider distributed Nash equilibrium seeking in monotone and hypomonotone games. We first assume that each player has knowledge of the opponents' decisions and p…
Continuous-Time Convergence Rates in Potential and Monotone Games
Bolin Gao, Lacra Pavel
In this paper, we provide exponential rates of convergence to the interior Nash equilibrium for continuous-time dual-space game dynamics such as mirror descent (MD) and actor-criti…
Continuous-time Discounted Mirror-Descent Dynamics in Monotone Concave Games
Bolin Gao, Lacra Pavel
In this paper, we consider concave continuous-kernel games characterized by monotonicity properties and propose discounted mirror descent-type dynamics. We introduce two classes of…
Single-timescale distributed GNE seeking for aggregative games over networks via forward-backward operator splitting
Dian Gadjov, Lacra Pavel
We consider aggregative games with affine coupling constraints, where agents have partial information on the aggregate value and can only communicate with neighbouring agents. We p…
Dynamic NE Seeking for Multi-Integrator Networked Agents with Disturbance Rejection
Andrew R Romano, Lacra Pavel
In this paper, we consider game problems played by (multi)-integrator agents, subject to external disturbances. We propose Nash equilibrium seeking dynamics based on gradient-play,…
Distributed GNE seeking under partial-decision information over networks via a doubly-augmented operator splitting approach
Lacra Pavel
We consider distributed computation of generalized Nash equilibrium (GNE) over networks, in games with shared coupling constraints. Existing methods require that each player has fu…
On Passivity, Reinforcement Learning and Higher-Order Learning in Multi-Agent Finite Games
Bolin Gao, Lacra Pavel
In this paper, we propose a passivity-based methodology for analysis and design of reinforcement learning in multi-agent finite games. Starting from a known exponentially-discounte…
On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems
Shuvomoy Das Gupta, Lacra Pavel
In this paper, we propose a multi-player extension of the minimum cost flow problem inspired by a transportation problem that arises in modern transportation industry. We associate…
From Game-theoretic Multi-agent Log Linear Learning to Reinforcement Learning
Mohammadhosein Hasanbeig, Lacra Pavel
The main focus of this paper is on enhancement of two types of game-theoretic learning algorithms: log-linear learning and reinforcement learning. The standard analysis of log-line…
Asynchronous distributed algorithms for seeking generalized Nash equilibria under full and partial decision information
Peng Yi, Lacra Pavel
We investigate asynchronous distributed algorithms with delayed information for seeking generalized Nash equilibrium over multi-agent networks. The considered game model has all pl…
Distributed Nash Equilibrium Seeking under Partial-Decision Information via the Alternating Direction Method of Multipliers
Farzad Salehisadaghiani, Wei Shi, Lacra Pavel
In this paper, we consider the problem of finding a Nash equilibrium in a multi-player game over generally connected networks. This model differs from a conventional setting in tha…
A Passivity-Based Approach to Nash Equilibrium Seeking over Networks
Dian Gadjov, Lacra Pavel
In this paper we consider the problem of distributed Nash equilibrium (NE) seeking over networks, a setting in which players have limited local information. We start from a continu…
Distributed generalized Nash equilibria computation of monotone games via a preconditioned proximal point algorithm
Peng Yi, Lacra Pavel
In this paper, we investigate distributed generalized Nash equilibrium (GNE) computation of monotone games with affine coupling constraints. Each player can only utilize its local…
On the Properties of the Softmax Function with Application in Game Theory and Reinforcement Learning
Bolin Gao, Lacra Pavel
In this paper, we utilize results from convex analysis and monotone operator theory to derive additional properties of the softmax function that have not yet been covered in the ex…
A Distributed Nash Equilibrium Seeking in Networked Graphical Games
Farzad Salehisadaghiani, Lacra Pavel
This paper considers a distributed gossip approach for finding a Nash equilibrium in networked games on graphs. In such games a player's cost function may be affected by the action…
Generalized Nash Equilibrium Problem by the Alternating Direction Method of Multipliers
Farzad Salehisadaghiani, Lacra Pavel
In this paper, the problem of finding a generalized Nash equilibrium (GNE) of a networked game is studied. Players are only able to choose their decisions from a feasible action se…
A distributed primal-dual algorithm for computation of generalized Nash equilibria with shared affine coupling constraints via operator splitting methods
Peng Yi, Lacra Pavel
In this paper, we propose a distributed primal-dual algorithm for computation of a generalized Nash equilibrium (GNE) in noncooperative games over network systems. In the considere…
Nash Equilibrium Seeking with Non-doubly Stochastic Communication Weight Matrix
Farzad Salehisadaghiani, Lacra Pavel
A distributed Nash equilibrium seeking algorithm is presented for networked games. We assume an incomplete information available to each player about the other players' actions. Th…
Distributed Nash Equilibrium Seeking via the Alternating Direction Method of Multipliers
Farzad Salehisadaghiani, Lacra Pavel
In this paper, the problem of finding a Nash equilibrium of a multi-player game is considered. The players are only aware of their own cost functions as well as the action space of…
Distributed Nash Equilibrium Seeking By Gossip in Games on Graphs
Farzad Salehisadaghiani, Lacra Pavel
We consider a gossip approach for finding a Nash equilibrium in a distributed multi-player network game. We extend previous results on Nash equilibrium seeking to the case when the…
A Robust Mixed Integer Optimization Model to Utilize Regenerative Energy of Trains in a Railway Network
Shuvomoy Das Gupta, J. Kevin Tobin, Lacra Pavel
In this paper we present a robust mixed integer optimization model to utilize regenerative braking energy produced by trains in a railway network. An electric train produces regene…