Stable Coalition-Governments: The Case of Three Political Parties
M. Socorro Puy
We explore to what extent we can propose fixed negotiation rules as well as simple mechanisms (or protocols) that guarantee that politi¬cal parties can form stable coalition-governments. We analyze the case where three parties can hold office in the form of two-party coalitions. We define the family of Weighted Rules, that select political agree¬ments as a function of the bliss-points of the parties, and electoral results (Camson's Law and equal-share among others are included). We show that every weighted rule yields a stable coalition. We make use of the theory of implementation to design a protocol (in the form of a mechanism) that guarantees that a stable coalition will govern. We find that no dominant-solvable mechanism can be used for this purpose, but there is a simultaneous-unanimity mechanism that im¬plements it in Nash and strong Nash equilibrium.
In order to set up a list of libraries that you have access to,
you must first login
or sign up.
Then set up a personal list of libraries from your profile page by
clicking on your user name at the top right of any screen.