Computing perfect pairwise stable networks
From MaRDI portal
Cites work
- A differentiable homotopy to compute Nash equilibria of n-person games
- A one-stage model of link formation and payoff division
- A strategic model of social and economic networks
- A variant of Harsanyi's tracing procedures to select a perfect equilibrium in normal form games
- Computing perfect stationary equilibria in stochastic games
- Definitions of equilibrium in network formation games
- Equilibrium computation in discrete network games
- EQUILIBRIUM SELECTION IN STOCHASTIC GAMES
- General equilibrium models and homotopy methods
- Homotopy methods to compute equilibria in game theory
- scientific article; zbMATH DE number 3167552 (Why is no real title available?)
- scientific article; zbMATH DE number 3809326 (Why is no real title available?)
- scientific article; zbMATH DE number 47120 (Why is no real title available?)
- scientific article; zbMATH DE number 47206 (Why is no real title available?)
- scientific article; zbMATH DE number 49749 (Why is no real title available?)
- Network potentials
- On perfect pairwise stable networks
- On the existence and uniqueness of pairwise stable networks
- On the existence of pairwise stable weighted networks
- Pairwise-stability and Nash equilibria in network formation
- Reexamination of the perfectness concept for equilibrium points in extensive games
- Social and economic networks.
- Strongly stable networks
- Structural estimation of pairwise stable networks with nonnegative externality
- The computation of pairwise stable networks
- The Logarithmic Stochastic Tracing Procedure: A Homotopy Method to Compute Stationary Equilibria of Stochastic Games
This page was built for publication: Computing perfect pairwise stable networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6867928)