Computing approximate Nash equilibria for integer programming games

DOI10.1007/S11590-025-02221-5MaRDI QIDQ7289071zbMATH OpenFDO

Authors Aloïs Duguet, Margarida Carvalho, Gabriele Dragotto, Sandra Ulrich Ngueveu

Publication date 2 July 2026

Published in Optimization Letters (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11590-025-02221-5

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX) Mathematical programming (90Cxx) Game theory (91Axx)

Cites work

• A branch-and-prune algorithm for discrete Nash equilibrium problems
• A linear programming approach to difference-of-convex piecewise linear approximation
• A supply chain network game theory model of cybersecurity investments with nonlinear budget constraints
• Benchmarking optimization software with performance profiles.
• Computing all solutions of Nash equilibrium problems with discrete strategy sets
• Computing equilibria for integer programming games
• Continuous piecewise linear delta-approximations for bivariate and multivariate functions
• Equilibrium identification and selection in finite games
• Title not available (Why is no real title available?)
• LinA: a faster approach to piecewise linear approximations using corridors and its application to mixed-integer optimization
• Linearly constrained global optimization via piecewise-linear approximation
• Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
• Mixed-integer nonlinear optimization
• Non-cooperative games
• On mathematical programming with indicator constraints
• Piecewise linear bounding of univariate nonlinear functions and resulting mixed integer linear programming-based solution methods
• Piecewise Linear Function Fitting via Mixed-Integer Linear Programming
• Piecewise linearization of bivariate nonlinear functions: minimizing the number of pieces under a bounded approximation error
• Rational generating functions and integer programming games
• Reformulation and convex relaxation techniques for global optimization
• Settling the complexity of two-player Nash equilibrium
• Simple search methods for finding a Nash equilibrium
• The Zero Regrets Algorithm: Optimizing over Pure Nash Equilibria via Integer Programming
• Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions
• Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions
• Using Piecewise Linear Functions for Solving MINLPs

This page was built for publication: Computing approximate Nash equilibria for integer programming games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7289071)