Computation of Nash equilibria: Admissibility of parallel gradient descent

DOI10.1007/BF02192245zbMath0866.90138OpenAlexW2118647653MaRDI QIDQ2564999

H. I. Bozma

Publication date: 7 January 1997

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02192245

zbMATH Keywords

multiple-objective optimizationintelligent sensor systemsparallel gradientpractical computation of Nash equilibria

Mathematics Subject Classification ID

Noncooperative games (91A10) Multi-objective and goal programming (90C29)

Related Items (4)

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 ⋮ An optimization framework of biological dynamical systems ⋮ Multiobjective stochastic control in fluid dynamics via game theory approach: Application to the periodic Burgers equation

Cites Work

• Unnamed Item
• Unnamed Item
• Inner functions in the unit ball of \({\mathbb{C}}^ n\)
• Some aspects of parallel and distributed iterative algorithms - a survey
• Distributed algorithms for the computation of noncooperative equilibria
• Relaxation techniques and asynchronous algorithms for on-line computation of non-cooperative equilibria
• Dynamic noncooperative game theory

This page was built for publication: Computation of Nash equilibria: Admissibility of parallel gradient descent