Computing equilibria for integer programming games
From MaRDI portal
Publication:2160491
Recommendations
Cites work
- \(N\)-fold integer programming and nonlinear multi-transshipment
- A Linear Programming Approach to the Cutting-Stock Problem
- A study on the computational complexity of the bilevel knapsack problem
- Algorithmic Game Theory
- An exact solution method for binary equilibrium problems with compensation and the power market uplift problem
- Asymptotic expected number of Nash equilibria of two-player normal form games
- Combinatorial optimization in Nash games
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Convergence to approximate Nash equilibria in congestion games
- Correlated Equilibrium as an Expression of Bayesian Rationality
- Equilibrium Points of Bimatrix Games
- scientific article; zbMATH DE number 3809326 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 3278986 (Why is no real title available?)
- scientific article; zbMATH DE number 3067835 (Why is no real title available?)
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- Motion planning with pulley, rope, and baskets
- New insights on integer-programming models for the kidney exchange problem
- Non-cooperative games
- On the complexity of the parity argument and other inefficient proofs of existence
- Outline of an algorithm for integer solutions to linear programs
- Potential games
- Production Planning by Mixed Integer Programming
- Rational generating functions and integer programming games
- Separable and low-rank continuous games
- Simple search methods for finding a Nash equilibrium
- Solving discretely-constrained Nash-Cournot games with an application to power markets
- Subjectivity and correlation in randomized strategies
- The trouble with the second quantifier
- Totally unimodular congestion games
Cited in
(10)- Integer programming methods for solving binary interdiction games
- Computation, Multiplicity, and Comparative Statics of Cournot Equilibria in Integers
- 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
- The Zero Regrets Algorithm: Optimizing over Pure Nash Equilibria via Integer Programming
- Generalized Nash equilibrium problems with mixed-integer variables
- Integration of sales and operations: a dynamic mixed-integer programming game
- Computing approximate Nash equilibria for integer programming 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)
