The computation of pairwise stable networks
From MaRDI portal
Publication:6120904
DOI10.1007/s10107-022-01791-xOpenAlexW4220954123MaRDI QIDQ6120904
Yang Zhan, P. Jean-Jacques Herings
Publication date: 21 February 2024
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-022-01791-x
Games involving graphs (91A43) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to game theory, economics, and finance (91-08)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Structural estimation of pairwise stable networks with nonnegative externality
- Pairwise-stability and Nash equilibria in network formation
- Stationary equilibria in stochastic games: structure, selection, and computation
- Homotopy methods to compute equilibria in game theory
- Definitions of equilibrium in network formation games
- Global Newton method for stochastic games
- New maximal numbers of equilibria in bimatrix games
- A global Newton method to compute Nash equilibria.
- On the existence and uniqueness of pairwise stable networks
- General equilibrium models and homotopy methods
- An arbitrary starting tracing procedure for computing subgame perfect equilibria
- Oddness of the number of equilibrium points: a new proof
- Network potentials
- Strongly stable networks
- A strategic model of social and economic networks
- On the Existence of Pairwise Stable Weighted Networks
- Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
- A note on a theorem of F. Browder
- Equilibrium computation in discrete network games
- Equilibrium Points of Bimatrix Games
- The Expected Number of Nash Equilibria of a Normal Form Game
- A differentiable homotopy to compute Nash equilibria of \(n\)-person games
