Generic determinacy of Nash equilibrium in network-formation games

DOI10.1016/j.geb.2008.10.004zbMath1165.91338OpenAlexW2091537558MaRDI QIDQ2389314

Carlos González Pimienta

Publication date: 15 July 2009

Published in: Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.geb.2008.10.004

zbMATH Keywords

networksNash equilibriumgeneric finiteness

Mathematics Subject Classification ID

Games involving graphs (91A43)

Related Items

The structure of Nash equilibria in Poisson games ⋮ Generic finiteness of outcome distributions for two-person game forms with three outcomes ⋮ Costly network formation and regular equilibria ⋮ Network formation and pairwise stability: a new oddness theorem

Cites Work

• Pairwise-stability and Nash equilibria in network formation
• Elementary structure of real algebraic varieties
• Generic finiteness of equilibrium outcome distributions for sender-receiver cheap-talk games
• Job contact networks.
• On the generic strategic stability of Nash equilibria if voting is costly
• The evolution of social and economic networks.
• Oddness of the number of equilibrium points: a new proof
• On the generic finiteness of equilibrium outcome distributions in bimatrix game forms
• A strategic model of social and economic networks
• Semi-Algebraic Local-Triviality in Semi-Algebraic Mappings
• Sequential Equilibria
• The Algebraic Geometry of Perfect and Sequential Equilibrium
• A Noncooperative Model of Network Formation
• On the Generic Finiteness of Equilibrium Outcome Distributions in Game Forms
• Refinements of the Nash equilibrium concept
• On the generic finiteness of equilibrium outcomes in plurality games
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item