Showing 1 - 1 of 1
We prove that for generic plurality games with positive cost of voting, the number of Nash equilibria is finite. Furthermore all the equilibria are regular, hence stable sets as singletons. Copyright Springer-Verlag Berlin/Heidelberg 2005
Persistent link: https://www.econbiz.de/10005370863