Decomposition algorithms for generalized potential games
From MaRDI portal
Recommendations
- A decomposition method for a class of convex generalized Nash equilibrium problems
- A decomposition method based on penalization for solving generalized Nash equilibrium problems
- Methods for solving generalized Nash equilibrium
- Algorithms for generalized potential games with mixed-integer variables
- Application of the decomposable penalty method to a class of generalized Nash equilibrium problems
Cites work
- scientific article; zbMATH DE number 3791104 (Why is no real title available?)
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 734901 (Why is no real title available?)
- scientific article; zbMATH DE number 775175 (Why is no real title available?)
- A numerical algorithm for finding solutions of a generalized Nash equilibrium problem
- A survey on networking games in telecommunications
- Algorithmic Game Theory
- Equilibrium, games, and pricing in transportation and telecommunication networks
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
- Extra-proximal methods for solving two-person nonzero-sum games
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Fundamentals of Wireless Communication
- Generalized Nash equilibrium problem, variational inequality and quasiconvexity
- Generalized Nash equilibrium problems
- Nash equilibria: the variational approach
- On search directions for minimization algorithms
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- Optimization and nonsmooth analysis
- Potential games
- Repeated play of potential games
Cited in
(52)- Conditionally Optimal Algorithms for Generalized B\"uchi Games
- A general framework for robust topology optimization under load-uncertainty including stress constraints
- Equilibrium selection for multi-portfolio optimization
- A globally convergent improved BFGS method for generalized Nash equilibrium problems
- Generalized Nash equilibrium problems
- Decompositions and potentials for normal form games
- A priori data-driven robustness guarantees on strategic deviations from generalised Nash equilibria
- The noncooperative fixed charge transportation problem
- Rational Generalized Nash Equilibrium Problems
- Linear and superlinear convergence of a potential reduction algorithm for generalized Nash equilibrium problems
- A distributed regularized Jacobi-type ADMM-method for generalized Nash equilibrium problems in Hilbert spaces
- A decomposition method for a class of convex generalized Nash equilibrium problems
- Parametrized inexact-ADMM based coordination games: a normalized Nash equilibrium approach
- A best-response approach for equilibrium selection in two-player generalized Nash equilibrium problems
- Generalized Nash equilibria for SaaS/PaaS clouds
- Decomposition methods for computing directional stationary solutions of a class of nonsmooth nonconvex optimization problems
- The standard pessimistic bilevel problem
- Asynchronous schemes for stochastic and misspecified potential games and nonconvex optimization
- A branch-and-prune algorithm for discrete Nash equilibrium problems
- Numerically tractable optimistic bilevel problems
- Nonatomic aggregative games with infinitely many types
- Decomposition algorithms for some deterministic and two-stage stochastic single-leader multi-follower games
- Equilibrium strategies for multiple interdictors on a common network
- The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials
- A linearized alternating direction method of multipliers with substitution procedure
- Extensions of Nash games in finite and infinite dimensions with applications
- Nonsmooth dynamics of generalized Nash games
- Non-cooperative games with minmax objectives
- Decomposable penalty method for generalized game problems with joint constraints
- Vector games with potential function
- Algorithms for generalized potential games with mixed-integer variables
- Computing all solutions of Nash equilibrium problems with discrete strategy sets
- Generalized Nash equilibrium problems in Banach spaces: theory, Nikaido-Isoda-based path-following methods, and applications
- A decomposition algorithm for Nash equilibria in intersection management
- Relaxation approach for equilibrium problems with equilibrium constraints
- Partial penalization for the solution of generalized Nash equilibrium problems
- Nonsingularity and stationarity results for quasi-variational inequalities
- An inverse-adjusted best response algorithm for Nash equilibria
- Privacy impact on generalized Nash equilibrium in peer-to-peer electricity market
- An alternating direction method for Nash equilibrium of two-person games with alternating offers
- Cournot tatonnement and potentials
- A survey on decomposition of finite strategic-form games
- Game formulations for structural optimization under uncertainty
- A parametrized variational inequality approach to track the solution set of a generalized Nash equilibrium problem
- ADMM-type methods for generalized Nash equilibrium problems in Hilbert spaces
- Distributed variable sample-size gradient-response and best-response schemes for stochastic Nash equilibrium problems
- A decomposition algorithm for N-player games
- Generalized Nash equilibrium and dynamics of popularity of online contents
- Generalized Nash equilibrium problems
- On the computation of equilibria in monotone and potential stochastic hierarchical games
- Gap functions for quasi-equilibria
- Price of anarchy in electric vehicle charging control games: when Nash equilibria achieve social welfare
This page was built for publication: Decomposition algorithms for generalized potential games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q763403)
