Computation, Multiplicity, and Comparative Statics of Cournot Equilibria in Integers
From MaRDI portal
Publication:3186547
DOI10.1287/moor.2015.0771zbMath1347.91189OpenAlexW2328690842MaRDI QIDQ3186547
Publication date: 10 August 2016
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1120af05e0a4a892ca5b864e9a87feb0616dbc0c
Integer programming (90C10) Noncooperative games (91A10) Special types of economic equilibria (91B52) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (3)
Potential games, path independence and Poisson's binomial distribution ⋮ Equilibrium computation in resource allocation games ⋮ Solving binary-constrained mixed complementarity problems using continuous reformulations
Cites Work
- Solving discrete systems of nonlinear equations
- Strategic complements and substitutes, and potential games
- Iterative computation of Cournot equilibrium
- Potential games
- Finding All n-Firm Cournot Equilibria
- Sensitivity theorems in integer linear programming
- A New Proof of the Existence and Uniqueness of the Cournot Equilibrium
- Stackelberg-Nash-Cournot Equilibria: Characterizations and Computations
This page was built for publication: Computation, Multiplicity, and Comparative Statics of Cournot Equilibria in Integers