On the rule of k names
The rule of k names can be described as follows: given a set of candidates for office, a committee chooses k members from this set by voting, and makes a list with their names. Then a single individual from outside the committee selects one of the listed names for the office. Different variants of this method have been used since the distant past and are still used today in many countries and for different types of choices. After documenting this widespread use by means of actual examples, we provide a game theoretical analysis. We concentrate on the plausible outcomes induced by the rule of k names when the agents involved act strategically. Our analysis shows how the parameter k, the screening rule and the nature of candidacies act as a means to balance the power of the committee with that of the chooser.
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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
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.:
- Peleg,Bezalel, 2008.
"Game Theoretic Analysis of Voting in Committees,"
Cambridge University Press, number 9780521074650, November.
- Murat R. Sertel & Remzi Sanver, 2001.
"Strong Equilibrium Outcomes of Voting Games are the Generalized Condorcet Winners,"
0107, Department of Economics, Bilkent University.
- Murat R. Sertel & M. Remzi Sanver, 2004. "Strong equilibrium outcomes of voting games ¶are the generalized Condorcet winners," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 22(2), pages 331-347, 04.
- Salvador Barbera & Hugo Sonnenschein & Lin Zhou, 1990.
"Voting by Committees,"
Cowles Foundation Discussion Papers
941, Cowles Foundation for Research in Economics, Yale University.
- Steven J. Brams & Samuel Merrill, III, 1983. "Equilibrium Strategies for Final-Offer Arbitration: There is no Median Convergence," Management Science, INFORMS, vol. 29(8), pages 927-941, August.
- Steven J. Brams & Samuel Merrill, III, 1986.
"Binding Versus Final-Offer Arbitration: A Combination is Best,"
INFORMS, vol. 32(10), pages 1346-1355, October.
- Brams, Steven J. & Merrill, Samuel III, 1984. "Binding Versus Final-Offer Arbitration: A Combination is Best," Working Papers 84-07, C.V. Starr Center for Applied Economics, New York University.
- Barış Kaymak & M. Remzi Sanver, 2003. "Sets of alternatives as Condorcet winners," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 20(3), pages 477-494, 06.
When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:70:y:2010:i:1:p:44-61. 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: (Shamier, Wendy)
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.