Interval methods for computing strong Nash equilibria of continuous games

DOI10.7494/dmms.2015.9.1.63zbMath1347.91017OpenAlexW2282518879MaRDI QIDQ2825646

Bartłomiej Jacek Kubica, Adam Wozniak

Publication date: 13 October 2016

Published in: Decision Making in Manufacturing and Services (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7494/dmms.2015.9.1.63

zbMATH Keywords

strong Nash equilibriainterval computationscontinuous gamesnumerical game solving

Mathematics Subject Classification ID

Noncooperative games (91A10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) (n)-person games, (n>2) (91A06) General methods in interval analysis (65G40) Computational methods for problems pertaining to game theory, economics, and finance (91-08) Numerical methods for mathematical programming, optimization and variational techniques (65K99)

Related Items

Computing the strong \(L_p\)-Nash equilibrium for Markov chains games: convergence and uniqueness

Uses Software

• C-XSC
• OpenBLAS

Cites Work

• OpenBLAS