Computing equilibria for integer programming games

DOI10.1016/J.EJOR.2022.03.048OpenAlexW4220752472WikidataQ114184301 ScholiaQ114184301MaRDI QIDQ2160491FDOQ2160491

Authors: Margarida Carvalho, Andrea Lodi, João Pedro Pedroso 

Publication date: 3 August 2022

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.07082

Recommendations

• Rational generating functions and integer programming games
• The Zero Regrets Algorithm: Optimizing over Pure Nash Equilibria via Integer Programming
• Computing equilibria of Cournot oligopoly models with mixed-integer quantities
• Recent Advances in Constraints
• LATIN 2004: Theoretical Informatics

zbMATH Keywords

combinatorial optimizationNash equilibriaalgorithmic game theorycorrelated equilibriainteger programming games

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Non-cooperative games
• Algorithmic Game Theory
• Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
• A Linear Programming Approach to the Cutting-Stock Problem
• Title not available (Why is that?)
• Production Planning by Mixed Integer Programming
• Title not available (Why is that?)
• Subjectivity and correlation in randomized strategies
• Potential games
• Outline of an algorithm for integer solutions to linear programs
• Correlated Equilibrium as an Expression of Bayesian Rationality
• Title not available (Why is that?)
• On the complexity of the parity argument and other inefficient proofs of existence
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Equilibrium Points of Bimatrix Games
• Solving discretely-constrained Nash-Cournot games with an application to power markets
• Title not available (Why is that?)
• New insights on integer-programming models for the kidney exchange problem
• Asymptotic expected number of Nash equilibria of two-player normal form games
• Convergence to approximate Nash equilibria in congestion games
• Motion planning with pulley, rope, and baskets
• Simple search methods for finding a Nash equilibrium
• Rational generating functions and integer programming games
• \(N\)-fold integer programming and nonlinear multi-transshipment
• Separable and low-rank continuous games
• An exact solution method for binary equilibrium problems with compensation and the power market uplift problem
• A study on the computational complexity of the bilevel knapsack problem
• Combinatorial optimization in Nash games
• The trouble with the second quantifier
• Totally unimodular congestion games

Cited In (8)

• A branch-and-prune algorithm for discrete Nash equilibrium problems
• Computation, Multiplicity, and Comparative Statics of Cournot Equilibria in Integers
• Rejection-proof mechanisms for multi-agent kidney exchange
• The Zero Regrets Algorithm: Optimizing over Pure Nash Equilibria via Integer Programming
• Inverse optimization of integer programming games for parameter estimation arising from competitive retail location selection
• Integer programming methods for solving binary interdiction games
• Generalized Nash equilibrium problems with mixed-integer variables
• Integer programming methods to identify Nash equilibrium solutions for platform-based scheduling games

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

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