Distributed algorithms for aggregative games on graphs
From MaRDI portal
Publication:2830752
DOI10.1287/OPRE.2016.1501zbMATH Open1348.91074arXiv1605.00267OpenAlexW2345998142MaRDI QIDQ2830752FDOQ2830752
Authors: Jayash Koshal, Angelia Nedić, Uday V. Shanbhag 
Publication date: 31 October 2016
Published in: Operations Research (Search for Journal in Brave)
Abstract: We consider a class of Nash games, termed as aggregative games, being played over a networked system. In an aggregative game, a player's objective is a function of the aggregate of all the players' decisions. Every player maintains an estimate of this aggregate, and the players exchange this information with their local neighbors over a connected network. We study distributed synchronous and asynchronous algorithms for information exchange and equilibrium computation over such a network. Under standard conditions, we establish the almost-sure convergence of the obtained sequences to the equilibrium point. We also consider extensions of our schemes to aggregative games where the players' objectives are coupled through a more general form of aggregate function. Finally, we present numerical results that demonstrate the performance of the proposed schemes.
Full work available at URL: https://arxiv.org/abs/1605.00267
Recommendations
- Distributed convergence to Nash equilibria in network and average aggregative games
- Asynchronous networked aggregative games
- Distributed Nash equilibrium seeking in an aggregative game on a directed graph
- Distributed algorithms for aggregative games of multiple heterogeneous Euler-Lagrange systems
- Distributed Nash equilibrium seeking for aggregative games with coupled constraints
Cites Work
- Constrained Consensus and Optimization in Multi-Agent Networks
- Large-Population Cost-Coupled LQG Problems With Nonuniform Agents: Individual-Mass Behavior and Decentralized $\varepsilon$-Nash Equilibria
- Potential games
- Nash equilibria: the variational approach
- On the Existence of Cournot Equilibrium
- Distributed Subgradient Methods for Multi-Agent Optimization
- Aggregative games and best-reply potentials
- The evolutionary stability of perfectly competitive behavior
- Solving variational inequalities with Stochastic Mirror-Prox algorithm
- Distributed Subgradient Methods for Convex Optimization Over Random Networks
- Strategic complements and substitutes, and potential games
- A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
- Synchronization of Coupled Oscillators is a Game
- Title not available (Why is that?)
- On Distributed Averaging Algorithms and Quantization Effects
- Regularized Iterative Stochastic Approximation Methods for Stochastic Variational Inequality Problems
- Distributed stochastic subgradient projection algorithms for convex optimization
- Nash Equilibrium Problems With Scaled Congestion Costs and Shared Constraints
- Games with coupled propagated constraints in optical networks with multi-link topologies
- Asynchronous Broadcast-Based Convex Optimization Over a Network
- An extension of duality to a game-theoretic framework
- The theory of oligopoly with multi-product firms
- On complexity as bounded rationality (extended abstract)
- Convergence of a Multi-Agent Projected Stochastic Gradient Algorithm for Non-Convex Optimization
- Title not available (Why is that?)
- Diffusion Strategies Outperform Consensus Strategies for Distributed Estimation Over Adaptive Networks
- Distributed Computation of Equilibria in Monotone Nash Games via Iterative Regularization Techniques
- A Noncooperative Game Approach to OSNR Optimization in Optical Networks
- Representing equilibrium aggregates in aggregate games with applications to common agency
- Unifying view on min-max fairness, max-min fairness, and utility optimization in cellular networks
- Consensus Propagation
- A new class of distributed optimization algorithms: application to regression of distributed data
- Joint Sensing and Power Allocation in Nonconvex Cognitive Radio Games: Nash Equilibria and Distributed Algorithms
- Convergence of Min-Sum Message-Passing for Convex Optimization
- On the Influence of Informed Agents on Learning and Adaptation Over Networks
Cited In (56)
- Distributed Nash equilibrium seeking of aggregative games under networked attacks
- Distributed aggregative games for Euler-Lagrange systems with system parameter uncertainties
- Communication-efficient distributed Nash equilibrium seeking under switching topologies: a decentralized gradient-based event-triggered scheme
- Nonconvex distributed feedback optimization for aggregative cooperative robotics
- Distributed projection‐free algorithm for constrained aggregative optimization
- Distributed Nash equilibrium seeking strategies via bilateral bounded gradient approach
- Distributed Nash equilibrium seeking for multi-cluster aggregative games with applications to location control
- Bayesian Nash equilibrium seeking for multi-agent incomplete-information aggregative games
- Seeking strategy design for distributed nonsmooth games and its application
- Preface to the special issue on information and decisions in social and economic networks
- An Incentive Mechanism for Agents Playing Competitive Aggregative Games
- Distributed strategy-updating rules for aggregative games of multi-integrator systems with coupled constraints
- Distributed convergence to Nash equilibria in network and average aggregative games
- Continuous-time distributed Nash strategy over switching topologies with gain adaptation
- A variational inequality framework for network games: existence, uniqueness, convergence and sensitivity analysis
- An operator splitting approach for distributed generalized Nash equilibria computation
- Distributed Nash equilibrium seeking under partial-decision information via the alternating direction method of multipliers
- Distributed generalized Nash equilibrium seeking: a backward-reflected-forward-backward-based algorithm
- Linear quadratic network games with dynamic players: stabilization and output convergence to Nash equilibrium
- Parametrized inexact-ADMM based coordination games: a normalized Nash equilibrium approach
- Asynchronous networked aggregative games
- Multi-Player Diffusion Games on Graph Classes
- Distributed adaptive Nash equilibrium seeking and disturbance rejection for noncooperative games of high‐order nonlinear systems with input saturation and input delay
- Parallelization of game theoretic centrality algorithms
- On Distributed Generalized Nash Equilibrium Seeking
- Distributed Nash equilibrium computation in aggregative games: an event-triggered algorithm
- Distributed Variable Sample-Size Gradient-Response and Best-Response Schemes for Stochastic Nash Equilibrium Problems
- Distributed dynamics for aggregative games: Robustness and privacy guarantees
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
- Multi-cluster distributed optimization via random sleep strategy
- Differentially private distributed algorithms for stochastic aggregative games
- Distributed aggregative games on graphs in adversarial environments
- Multi-leader multi-follower model with aggregative uncertainty
- Variance-based subgradient extragradient method for stochastic variational inequality problems
- Distributed Nash equilibrium seeking for networked games of multiple high-order systems with disturbance rejection and communication delay
- A note on concurrent graph sharing games
- Distributed Nash equilibrium seeking for aggregative games with coupled constraints
- Fast generalized Nash equilibrium seeking under partial-decision information
- Solving leaderless multi-cluster games over directed graphs
- Distributed Nash equilibrium seeking for aggregative games with second-order nonlinear players
- Distributed averaging integral Nash equilibrium seeking on networks
- Stochastic generalized Nash equilibrium seeking under partial-decision information
- Continuous-time distributed Nash equilibrium seeking algorithms for non-cooperative constrained games
- Generalized multi-cluster game under partial-decision information with applications to management of energy Internet
- Decentralized inertial best-response with voluntary and limited communication in random communication networks
- Distributed algorithm for \(\varepsilon \)-generalized Nash equilibria with uncertain coupled constraints
- Continuous-time fully distributed generalized Nash equilibrium seeking for multi-integrator agents
- Distributed event-triggered aggregative optimization with applications to price-based energy management
- Distributed generalized Nash equilibrium seeking algorithm for nonsmooth aggregative games
- Asynchronous Schemes for Stochastic and Misspecified Potential Games and Nonconvex Optimization
- On the linear convergence of distributed Nash equilibrium seeking for multi-cluster games under partial-decision information
- A distributed Bregman forward-backward algorithm for a class of Nash equilibrium problems
- Asynchronous variance-reduced block schemes for composite non-convex stochastic optimization: block-specific steplengths and adapted batch-sizes
- Asynchronous Algorithms for Computing Equilibrium Prices in a Capital Asset Pricing Model
- Distributed algorithms for aggregative games of multiple heterogeneous Euler-Lagrange systems
- Adaptive approaches for fully distributed Nash equilibrium seeking in networked games
This page was built for publication: Distributed algorithms for aggregative games on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830752)
