Nash Equilibrium Problems With Scaled Congestion Costs and Shared Constraints
From MaRDI portal
Recommendations
- Settling the complexity of Nash equilibrium in congestion games
- Optimal cost-sharing in weighted congestion games
- Approximate pure Nash equilibria in weighted congestion games
- Pure Nash equilibria in player-specific and weighted congestion games
- Tight bounds for cost-sharing in weighted congestion games
- Convergence to approximate Nash equilibria in congestion games
- Convergence to approximate Nash equilibria in congestion games
- On the existence of pure Nash equilibria in weighted congestion games
- On the existence of pure Nash equilibria in weighted congestion games
Cited in
(31)- On stochastic mirror-prox algorithms for stochastic Cartesian variational inequalities: randomized block coordinate and optimal averaging schemes
- 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 convergence rates of game theoretic reinforcement learning algorithms
- The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials
- Distributed Nash equilibrium seeking for aggregative games with second-order nonlinear players
- Generalized Nash equilibrium seeking algorithm design for distributed constrained noncooperative games with second-order players
- An extremum seeking-based approach for Nash equilibrium seeking in N-cluster noncooperative games
- Distributed convergence to Nash equilibria in network and average aggregative games
- Parametrized inexact-ADMM based coordination games: a normalized Nash equilibrium approach
- Distributed averaging integral Nash equilibrium seeking on networks
- Generalized Nash equilibrium seeking algorithm design for distributed multi-cluster games
- Generalized multi-cluster game under partial-decision information with applications to management of energy Internet
- On robust solutions to uncertain linear complementarity problems and their variants
- Distributed algorithms for aggregative games on graphs
- An approximation scheme for a class of risk-averse stochastic equilibrium problems
- Distributed Nash equilibrium seeking: a gossip-based algorithm
- An incentive mechanism for agents playing competitive aggregative games
- Distributed variable sample-size gradient-response and best-response schemes for stochastic Nash equilibrium problems
- On synchronous, asynchronous, and randomized best-response schemes for stochastic Nash games
- A method with convergence rates for optimization problems with variational inequality constraints
- scientific article; zbMATH DE number 7742927 (Why is no real title available?)
- Distributed adaptive Nash equilibrium seeking and disturbance rejection for noncooperative games of high‐order nonlinear systems with input saturation and input delay
- Distributed Nash equilibrium learning: A second‐order proximal algorithm
- Edge-based distributed primal-dual algorithms for seeking generalized Nash equilibria
- Distributed Nash equilibrium seeking for aggregative games of linear systems subject to unknown disturbances
- Differentially private distributed Nash equilibrium seeking based on gradient tracking and communication compression
- Nash equilibrium seeking of monotone N-coalition games
- Divide to conquer: decomposition methods for energy optimization
- A distributed iterative Tikhonov method for networked monotone stochastic and hierarchical aggregative games
- Distributed robust adaptive equilibrium computation for generalized convex games
This page was built for publication: Nash Equilibrium Problems With Scaled Congestion Costs and Shared Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5347786)
