Showing 1 - 4 of 4
We prove that for generic network-formation games where players incur a strictly positive cost to propose links the number of Nash equilibria is finite. Furthermore all Nash equilibria are regular and, therefore, stable sets.
Persistent link: https://www.econbiz.de/10008494988
In games with population uncertainty some perfect equilibria are in dominated strategies. We prove that every Poisson game has at least one perfect equilibrium in undominated strategies.
Persistent link: https://www.econbiz.de/10005066726
Persistent link: https://www.econbiz.de/10005408649
Persistent link: https://www.econbiz.de/10005409402