Computing equilibria for integer programming games
From MaRDI portal
Publication:2160491
DOI10.1016/j.ejor.2022.03.048OpenAlexW4220752472WikidataQ114184301 ScholiaQ114184301MaRDI QIDQ2160491
Andrea Lodi, Margarida Carvalho, 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
combinatorial optimizationNash equilibriaalgorithmic game theorycorrelated equilibriainteger programming games
Related Items
A branch-and-prune algorithm for discrete Nash equilibrium problems, Inverse optimization of integer programming games for parameter estimation arising from competitive retail location selection, Integer programming methods to identify Nash equilibrium solutions for platform-based scheduling games, Rejection-proof mechanisms for multi-agent kidney exchange
Cites Work
- Solving discretely-constrained Nash-Cournot games with an application to power markets
- Motion planning with pulley, rope, and baskets
- \(N\)-fold integer programming and nonlinear multi-transshipment
- Simple search methods for finding a Nash equilibrium
- Separable and low-rank continuous games
- Subjectivity and correlation in randomized strategies
- On the complexity of the parity argument and other inefficient proofs of existence
- An exact solution method for binary equilibrium problems with compensation and the power market uplift problem
- Combinatorial optimization in Nash games
- Potential games
- The trouble with the second quantifier
- New insights on integer-programming models for the kidney exchange problem
- Asymptotic expected number of Nash equilibria of two-player normal form games
- Non-cooperative games
- Rational Generating Functions and Integer Programming Games
- A Study on the Computational Complexity of the Bilevel Knapsack Problem
- Outline of an algorithm for integer solutions to linear programs
- A Linear Programming Approach to the Cutting-Stock Problem
- Correlated Equilibrium as an Expression of Bayesian Rationality
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Totally Unimodular Congestion Games
- Equilibrium Points of Bimatrix Games
- Algorithmic Game Theory
- Production Planning by Mixed Integer Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
