Interval methods for computing strong Nash equilibria of continuous games
From MaRDI portal
General methods in interval analysis (65G40) Numerical methods for mathematical programming, optimization and variational techniques (65K99) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Computational methods for problems pertaining to game theory, economics, and finance (91-08) (n)-person games, (n>2) (91A06) Noncooperative games (91A10)
Recommendations
- A continuation method for Nash equilibria in structured games
- Advanced interval tools for computing solutions of continuous games
- Computing the strong Nash equilibrium for Markov chains games
- Nash equilibrium in differential games and the construction of the programmed iteration method
- On a general scheme of constructing iterative methods for searching for a Nash equilibrium in concave games
- scientific article; zbMATH DE number 440591
- Approximating Nash equilibria in nonzero-sum games
- Continuity and sensitivity analysis of parameterized Nash games
- Finding the strong Nash equilibrium: computation, existence and characterization for Markov games
Cites work
Cited in
(5)- Computing the strong Nash equilibrium for Markov chains games
- Computing the strong \(L_p\)-Nash equilibrium for Markov chains games: convergence and uniqueness
- Brown-Robinson method for interval matrix games
- Advanced interval tools for computing solutions of continuous games
- Recent Advances in Constraints
This page was built for publication: Interval methods for computing strong Nash equilibria of continuous games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2825646)
