Rights:
Atribución-NoComercial-SinDerivadas 3.0 España
Abstract:
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.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.[+][-]