Advanced Search
MyIDEAS: Login to save this paper or follow this series

Dividing the indivisible : procedures for allocating cabinet ministries to political parties in a parliamentary system

Contents:

Author Info

  • Brams,S.L.
  • Kaplan,T.R.

    (Institute of Mathematical Economics, Bielefeld University)

Abstract

Political 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.

(This abstract was borrowed from another version of this item.)

Download Info

If 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.
File URL: http://www.imw.uni-bielefeld.de/papers/files/imw-wp-340.pdf
Download Restriction: no

Bibliographic Info

Paper provided by Bielefeld University, Center for Mathematical Economics in its series Working Papers with number 340.

as in new window
Length:
Date of creation: 2002
Date of revision:
Handle: RePEc:bie:wpaper:340

Contact details of provider:
Postal: Postfach 10 01 31, 33501 Bielefeld
Phone: +49(0)521-106-4907
Web page: http://www.imw.uni-bielefeld.de/
More information through EDIRC

Related research

Keywords: parliament;

Other versions of this item:

Find related papers by JEL classification:

References

References listed on IDEAS
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.:
as in new window
  1. Carmignani, Fabrizio, 2001. "Cabinet Formation in Coalition Systems," Scottish Journal of Political Economy, Scottish Economic Society, vol. 48(3), pages 313-29, August.
  2. 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, April.
  3. 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.
  4. 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.
  5. Brams,Steven J. & Taylor,Alan D., 1996. "Fair Division," Cambridge Books, Cambridge University Press, number 9780521556446, April.
  6. Steven J. Brams & Paul H. Edelman & Peter C. Fishburn, 2003. "Fair Division Of Indivisible Items," Theory and Decision, Springer, vol. 55(2), pages 147-180, 09.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. 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.
  2. 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.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:bie:wpaper:340. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dr. Frederik Herzberg).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.