Distributed algorithms for the computation of noncooperative equilibria
From MaRDI portal
Publication:1090263
DOI10.1016/0005-1098(87)90081-1zbMath0619.90092OpenAlexW2039404515MaRDI QIDQ1090263
Publication date: 1987
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0005-1098(87)90081-1
convergenceuniqueness conditionscomputation of noncooperative equilibriacontraction of general nonlinear operatorsexistence, stabilityfish warinaccurate search techniquesnonquadratic convex Nash games
Noncooperative games (91A10) 2-person games (91A05) Applications of game theory (91A80) Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76)
Related Items
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, A Nash-game approach to joint image restoration and segmentation, Optimization reformulations of the generalized Nash equilibrium problem using Nikaido-Isoda-type functions, Distributed computation of Pareto solutions in \(n\)-player games, Asynchronous algorithms in non-cooperative games, Relaxation techniques and asynchronous algorithms for on-line computation of non-cooperative equilibria, On generalized Nash games and variational inequalities, Bilevel direct search method for leader-follower problems and application in health insurance, \(S\)-modular games, with queueing applications, Affine Relaxations of the Best Response Algorithm: Global Convergence in Ratio-Bounded Games, Game theoretical security detection strategy for networked systems, Distributed robust adaptive equilibrium computation for generalized convex games, An Inverse-Adjusted Best Response Algorithm for Nash Equilibria, A dynamic Cournot-Nash game: a representation of a finitely repeated feedback game, Fast convergence to Nash equilibria without steady-state oscillation, Distributed Nash equilibrium seeking under partial-decision information via the alternating direction method of multipliers, Sequential decomposition and policy iteration schemes for \(M\)-player games with partial weak coupling, Regularized stochastic team problems, On-line computation of Stackelberg equilibria with synchronous parallel genetic algorithms, Routing and dynamic resource assignment joint game: a non-cooperative model for QoS routing, Distributed convergence to Nash equilibria in two-network zero-sum games, A Bayesian optimization approach to find Nash equilibria, Distributed averaging integral Nash equilibrium seeking on networks, Nash equilibrium seeking in quadratic noncooperative games under two delayed information-sharing schemes, Asynchronous networked aggregative games, Network capacity management under competition, Computation of Nash equilibria: Admissibility of parallel gradient descent, Nonzero-Sum Games of Optimal Stopping and Generalized Nash Equilibrium Problems, The Cauchy problem for a nonlinear elliptic equation: Nash-game approach and application to image inpainting
Cites Work
- An equilibrium theory for multiperson decision making with multiple probabilistic models
- Distributed asynchronous computation of fixed points
- Iterative Techniques for the Nash Solution in Quadratic Games with Unknown Parameters
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
- Games with Incomplete Information Played by “Bayesian” Players Part II. Bayesian Equilibrium Points
- 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, I–III Part I. The Basic Model
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
