Distributed online path-length-independent algorithm for noncooperative games over unbalanced digraphs
From MaRDI portal
Cites work
- A specified-time convergent multiagent system for distributed optimization with a time-varying objective function
- A timestamp-based projected gradient play for distributed Nash equilibrium seeking in monotone games
- An Online Convex Optimization Approach to Proactive Network Resource Allocation
- Continuous-time fully distributed generalized Nash equilibrium seeking for multi-integrator agents
- Decentralized online convex optimization based on signs of relative states
- Distributed algorithm for nonsmooth multi-coalition games and its application in electricity markets
- Distributed Continuous-Time Algorithms for Time-Varying Constrained Convex Optimization
- Distributed Continuous-Time Convex Optimization on Weight-Balanced Digraphs
- Distributed generalized Nash equilibrium seeking algorithm for nonsmooth aggregative games
- Distributed Mirror Descent for Online Composite Optimization
- Distributed Nash equilibrium seeking for aggregative games with second-order nonlinear players
- Distributed Nash equilibrium seeking in an aggregative game on a directed graph
- Distributed Online Optimization in Dynamic Environments Using Mirror Descent
- Distributed sub-optimal resource allocation via a projected form of singular perturbation
- Ensuring both almost sure convergence and differential privacy in Nash equilibrium seeking on directed graphs
- Forgetting-factor regrets for online convex optimization
- Generalized Nash equilibrium problems
- Generalized Nash equilibrium seeking algorithm design for distributed constrained noncooperative games with second-order players
- Generalized Nash equilibrium seeking strategy for distributed nonsmooth multi-cluster game
- Geometric Convergence of Gradient Play Algorithms for Distributed Nash Equilibrium Seeking
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- Nash equilibria: the variational approach
- Nash Equilibrium Computation in Subnetwork Zero-Sum Games With Switching Communications
- Nash equilibrium seeking in N-coalition games via a gradient-free method
- Nash-Cournot Equilibria in Electric Power Markets with Piecewise Linear Demand Functions and Joint Constraints
- On the Exact Convergence to Nash Equilibrium in Hypomonotone Regimes Under Full and Partial-Decision Information
- Online Distributed Algorithms for Seeking Generalized Nash Equilibria in Dynamic Environments
- Online Optimization With Predictions and Switching Costs: Fast Algorithms and the Fundamental Limit
- Online Primal-Dual Methods With Measurement Feedback for Time-Varying Convex Optimization
- Opinion dynamics in social networks with stubborn agents: equilibrium and convergence rate
- Prediction-Correction Interior-Point Method for Time-Varying Convex Optimization
- Privacy-Preserving Distributed Online Optimization Over Unbalanced Digraphs via Subgradient Rescaling
- Probably Approximately Correct Nash Equilibrium Learning
- Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimization
- Robust Portfolio Selection Problems
- Tailoring gradient methods for differentially private distributed optimization
Cited in
(1)
This page was built for publication: Distributed online path-length-independent algorithm for noncooperative games over unbalanced digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7012297)
