A branch-and-prune algorithm for discrete Nash equilibrium problems

DOI10.1007/s10589-023-00500-4OpenAlexW4383499422MaRDI QIDQ6051302

Oliver Stein, Stefan Schwarze

Publication date: 19 October 2023

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

Full work available at URL: https://doi.org/10.1007/s10589-023-00500-4

zbMATH Keywords

branch and boundNash equilibrium problembranch and prunediscrete game

Mathematics Subject Classification ID

Equilibrium refinements (91A11)

Related Items (1)

Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming

Cites Work

• Nonsmooth optimization reformulations of player convex generalized Nash equilibrium problems
• Decomposition algorithms for generalized potential games
• Generalized Nash equilibrium problems and Newton methods
• Potential games
• Computing equilibria for integer programming games
• Non-cooperative games
• Computing All Solutions of Nash Equilibrium Problems with Discrete Strategy Sets
• Rational Generating Functions and Integer Programming Games
• On generalized Nash equilibrium problems with linear coupling constraints and mixed-integer variables
• Mixed-integer nonlinear optimization
• Equilibrium points in n -person games
• Merit functions: a bridge between optimization and equilibria
• Generalized Nash equilibrium problems

This page was built for publication: A branch-and-prune algorithm for discrete Nash equilibrium problems