Distributed Algorithms for Aggregative Games on Graphs

DOI10.1287/opre.2016.1501zbMath1348.91074arXiv1605.00267OpenAlexW2345998142MaRDI QIDQ2830752

Angelia Nedić, Jayash Koshal, Uday V. Shanbhag

Publication date: 31 October 2016

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.00267

zbMATH Keywords

noncooperative gamesnetwork applicationssystems solution

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43)

Related Items

Asynchronous variance-reduced block schemes for composite non-convex stochastic optimization: block-specific steplengths and adapted batch-sizes, Differentially private distributed algorithms for stochastic aggregative games, Distributed Variable Sample-Size Gradient-Response and Best-Response Schemes for Stochastic Nash Equilibrium Problems, Multi-leader multi-follower model with aggregative uncertainty, Distributed algorithm for \(\varepsilon \)-generalized Nash equilibria with uncertain coupled constraints, Continuous-time distributed Nash equilibrium seeking algorithms for non-cooperative constrained games, Continuous-time fully distributed generalized Nash equilibrium seeking for multi-integrator agents, Adaptive approaches for fully distributed Nash equilibrium seeking in networked games, Linear quadratic network games with dynamic players: stabilization and output convergence to Nash equilibrium, Distributed generalized Nash equilibrium seeking algorithm for nonsmooth aggregative games, Distributed Nash equilibrium seeking for aggregative games with coupled constraints, Distributed convergence to Nash equilibria in network and average aggregative games, Distributed dynamics for aggregative games: Robustness and privacy guarantees, Distributed adaptive Nash equilibrium seeking and disturbance rejection for noncooperative games of high‐order nonlinear systems with input saturation and input delay, Multi-cluster distributed optimization via random sleep strategy, Distributed event-triggered aggregative optimization with applications to price-based energy management, Seeking strategy design for distributed nonsmooth games and its application, Bayesian Nash equilibrium seeking for multi-agent incomplete-information aggregative games, Distributed generalized Nash equilibrium seeking: a backward-reflected-forward-backward-based algorithm, On the linear convergence of distributed Nash equilibrium seeking for multi-cluster games under partial-decision information, Distributed Nash equilibrium seeking for networked games of multiple high-order systems with disturbance rejection and communication delay, Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs, Distributed projection‐free algorithm for constrained aggregative optimization, Distributed Nash equilibrium seeking strategies via bilateral bounded gradient approach, Generalized multi-cluster game under partial-decision information with applications to management of energy Internet, An Incentive Mechanism for Agents Playing Competitive Aggregative Games, Distributed Nash equilibrium computation in aggregative games: an event-triggered algorithm, Distributed algorithms for aggregative games of multiple heterogeneous Euler-Lagrange systems, Asynchronous Schemes for Stochastic and Misspecified Potential Games and Nonconvex Optimization, 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, On Distributed Generalized Nash Equilibrium Seeking, Parametrized inexact-ADMM based coordination games: a normalized Nash equilibrium approach, Continuous-time distributed Nash strategy over switching topologies with gain adaptation, Distributed averaging integral Nash equilibrium seeking on networks, Variance-based subgradient extragradient method for stochastic variational inequality problems, Distributed Nash equilibrium seeking for aggregative games with second-order nonlinear players, Asynchronous networked aggregative games, Fast generalized Nash equilibrium seeking under partial-decision information, Preface to the Special Issue on Information and Decisions in Social and Economic Networks, Stochastic generalized Nash equilibrium seeking under partial-decision information, Asynchronous Algorithms for Computing Equilibrium Prices in a Capital Asset Pricing Model, Decentralized inertial best-response with voluntary and limited communication in random communication networks, A distributed Bregman forward-backward algorithm for a class of Nash equilibrium problems, Distributed strategy-updating rules for aggregative games of multi-integrator systems with coupled constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed stochastic subgradient projection algorithms for convex optimization
• Strategic complements and substitutes, and potential games
• An extension of duality to a game-theoretic framework
• Unifying view on min-max fairness, max-min fairness, and utility optimization in cellular networks
• Games with coupled propagated constraints in optical networks with multi-link topologies
• The theory of oligopoly with multi-product firms
• Representing equilibrium aggregates in aggregate games with applications to common agency
• Potential games
• Aggregative games and best-reply potentials
• The evolutionary stability of perfectly competitive behavior
• On complexity as bounded rationality (extended abstract)
• A new class of distributed optimization algorithms: application to regression of distributed data
• On the Existence of Cournot Equilibrium
• Consensus Propagation
• A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
• Diffusion Strategies Outperform Consensus Strategies for Distributed Estimation Over Adaptive Networks
• On the Influence of Informed Agents on Learning and Adaptation Over Networks
• Distributed Computation of Equilibria in Monotone Nash Games via Iterative Regularization Techniques
• Distributed Subgradient Methods for Multi-Agent Optimization
• On Distributed Averaging Algorithms and Quantization Effects
• Constrained Consensus and Optimization in Multi-Agent Networks
• Solving variational inequalities with Stochastic Mirror-Prox algorithm
• Convergence of Min-Sum Message-Passing for Convex Optimization
• A Noncooperative Game Approach to OSNR Optimization in Optical Networks
• Large-Population Cost-Coupled LQG Problems With Nonuniform Agents: Individual-Mass Behavior and Decentralized $\varepsilon$-Nash Equilibria
• Joint Sensing and Power Allocation in Nonconvex Cognitive Radio Games: Nash Equilibria and Distributed Algorithms
• Distributed Subgradient Methods for Convex Optimization Over Random Networks
• Asynchronous Broadcast-Based Convex Optimization Over a Network
• Nash Equilibrium Problems With Scaled Congestion Costs and Shared Constraints
• Synchronization of Coupled Oscillators is a Game
• Convergence of a Multi-Agent Projected Stochastic Gradient Algorithm for Non-Convex Optimization
• Regularized Iterative Stochastic Approximation Methods for Stochastic Variational Inequality Problems