Distributed algorithms for the computation of noncooperative equilibria
From MaRDI portal
(Redirected from Publication:1090263)
Recommendations
- Distributed methods for computing approximate equilibria
- Distributed Methods for Computing Approximate Equilibria
- Distributed Computation of Equilibria in Misspecified Convex Stochastic Nash Games
- Continuous-time distributed Nash equilibrium seeking algorithms for non-cooperative constrained games
- On the convergence to Nash equilibrium in problems of distributed computing
- Distributed Computation of Nash Equilibria in Linear-Quadratic Stochastic Differential Games
- Distributed computation of Pareto solutions in n-player games
- scientific article; zbMATH DE number 2202840
- Prescribed-time distributed Nash equilibrium seeking for noncooperation games
- Distributed algorithms for computing a fixed point of multi-agent nonexpansive operators
Cites work
- scientific article; zbMATH DE number 3466802 (Why is no real title available?)
- scientific article; zbMATH DE number 3441151 (Why is no real title available?)
- scientific article; zbMATH DE number 3206520 (Why is no real title available?)
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- An equilibrium theory for multiperson decision making with multiple probabilistic models
- Distributed asynchronous computation of fixed points
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
- Games with Incomplete Information Played by ‘Bayesian’ Players, Part III. The Basic Probability Distribution of the Game
- Games with Incomplete Information Played by “Bayesian” Players Part II. Bayesian Equilibrium Points
- Games with Incomplete Information Played by “Bayesian” Players, I–III Part I. The Basic Model
- Iterative Techniques for the Nash Solution in Quadratic Games with Unknown Parameters
Cited in
(42)- Relaxation techniques and asynchronous algorithms for on-line computation of non-cooperative equilibria
- Routing and dynamic resource assignment joint game: a non-cooperative model for QoS routing
- The Cauchy problem for a nonlinear elliptic equation: Nash-game approach and application to image inpainting
- Distributed robust adaptive equilibrium computation for generalized convex games
- Computation of Nash equilibria: Admissibility of parallel gradient descent
- Fast convergence to Nash equilibria without steady-state oscillation
- Asynchronous algorithms in non-cooperative games
- Distributed Nash equilibrium seeking under partial-decision information via the alternating direction method of multipliers
- S-modular games, with queueing applications
- Distributed convergence to Nash equilibria in two-network zero-sum games
- Game theoretical security detection strategy for networked systems
- A Nash-game approach to joint image restoration and segmentation
- Distributed algorithms for computing a fixed point of multi-agent nonexpansive operators
- Regularized stochastic team problems
- Asynchronous networked aggregative games
- Optimization reformulations of the generalized Nash equilibrium problem using Nikaido-Isoda-type functions
- Prescribed-time fully distributed Nash equilibrium seeking of nonlinear multi-agent systems over unbalanced digraphs
- Network capacity management under competition
- On the convergence to Nash equilibrium in problems of distributed computing
- Nonzero-sum games of optimal stopping and generalized Nash equilibrium problems
- Distributed Methods for Computing Approximate Equilibria
- On-line computation of Stackelberg equilibria with synchronous parallel genetic algorithms
- Non-cooperative games with minmax objectives
- FINDING NORMALIZED EQUILIBRIUM IN CONVEX-CONCAVE GAMES
- A Nash equilibrium solution in an oligopoly market: The search for Nash equilibrium solutions with replicator equations derived from the gradient dynamics of a simplex algorithm
- Bilevel direct search method for leader-follower problems and application in health insurance
- Affine Relaxations of the Best Response Algorithm: Global Convergence in Ratio-Bounded Games
- A Bayesian optimization approach to find Nash equilibria
- Distributed computation of Pareto solutions in n-player games
- On generalized Nash games and variational inequalities
- Nash equilibrium seeking in quadratic noncooperative games under two delayed information-sharing schemes
- An algorithm for distributing coalitional value calculations among cooperating agents
- An inverse-adjusted best response algorithm for Nash equilibria
- A distributed algorithm to obtain repeated games equilibria with discounting
- Sequential decomposition and policy iteration schemes for \(M\)-player games with partial weak coupling
- Distributed Computation of Nash Equilibria in Linear-Quadratic Stochastic Differential Games
- Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks
- Distributed averaging integral Nash equilibrium seeking on networks
- A dynamic Cournot-Nash game: a representation of a finitely repeated feedback game
- Nonconvex games with side constraints
- Distributed consensus in noncooperative inventory games
- Distributed computation of equilibria in monotone Nash games via iterative regularization techniques
This page was built for publication: Distributed algorithms for the computation of noncooperative equilibria
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1090263)
