Dividing the indivisible : procedures for allocating cabinet ministries to political parties in a parliamentary system
AbstractPolitical parties in Northern Ireland recently used a divisor method of apportionment to choose, in sequence, ten cabinet ministries. If the parties have complete information about each others' preferences, we show that it may not be rational for them to act sincerely by choosing their most-preferred ministry that is available. One consequence of acting sophisticatedly is that the resulting allocation may not be Pareto-optimal, making all the parties worse off. Another is nonmonotonicty-choosing earlier may hurt rather than help a party. We introduce a mechanism that combines sequential choices with a structured form of trading that results in sincere choices for two parties. Although there are difficulties in extending this mechanism to more than two parties, other approaches are explored, such as permitting parties to making consecutive choices not prescribed by an apportionment method. But certain problems, such as eliminating envy, remain.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Bielefeld University, Center for Mathematical Economics in its series Working Papers with number 340.
Date of creation: 2002
Date of revision:
Other versions of this item:
- Steven J. Brams & Todd R. Kaplan, 2002. "Dividing the Indivisible: Procedures for Allocating Cabinet Ministries to Political Parties in a Parliamentary System," Discussion Papers 0202, Exeter University, Department of Economics.
- Brams, S.J. & Kaplan, T.R., 2002. "Dividing the Indivisible: Procedures for Allocating Cabinet Ministries to Political Parties in a Parliamentary System," Working Papers 02-06, C.V. Starr Center for Applied Economics, New York University.
- C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
- D72 - Microeconomics - - Analysis of Collective Decision-Making - - - Political Processes: Rent-seeking, Lobbying, Elections, Legislatures, and Voting Behavior
- H11 - Public Economics - - Structure and Scope of Government - - - Structure and Scope of Government
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Friedrich Pukelsheim & Albert W. Marshall & Ingram Olkin, 2002. "A majorization comparison of apportionment methods in proportional representation," Social Choice and Welfare, Springer, vol. 19(4), pages 885-900.
- Carmignani, Fabrizio, 2001. "Cabinet Formation in Coalition Systems," Scottish Journal of Political Economy, Scottish Economic Society, vol. 48(3), pages 313-29, August.
- Edelman, Paul & Fishburn, Peter, 2001. "Fair division of indivisible items among people with similar preferences," Mathematical Social Sciences, Elsevier, vol. 41(3), pages 327-347, May.
- Brams, S. J. & Eldelman, P. H. & Fishburn, P. C., 2000.
"Fair Division of Indivisible Items,"
00-15, C.V. Starr Center for Applied Economics, New York University.
- Brams,Steven J. & Taylor,Alan D., 1996. "Fair Division," Cambridge Books, Cambridge University Press, number 9780521556446.
- Dorothea Herreiner & Clemens Puppe, 2002. "A simple procedure for finding equitable allocations of indivisible goods," Social Choice and Welfare, Springer, vol. 19(2), pages 415-430.
- Brams, Steven J. & Kilgour, D. Marc & Klamler, Christian, 2013. "Two-Person Fair Division of Indivisible Items: An Efficient, Envy-Free Algorithm," MPRA Paper 47400, University Library of Munich, Germany.
- Steven Brams & D. Kilgour & Christian Klamler, 2012.
"The undercut procedure: an algorithm for the envy-free division of indivisible items,"
Social Choice and Welfare,
Springer, vol. 39(2), pages 615-631, July.
- Brams, Steven J. & Kilgour, D. Marc & Klamler, Christian, 2009. "The undercut procedure: an algorithm for the envy-free division of indivisible items," MPRA Paper 12774, University Library of Munich, Germany.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dr. Frederik Herzberg).
If references are entirely missing, you can add them using this form.