Sequential composition of voting rules in multi-issue domains
In many real-world group decision making problems, the set of alternatives is a Cartesian product of finite value domains for each of a given set of variables (or issues). Dealing with such domains leads to the following well-known dilemma: either ask the voters to vote separately on each issue, which may lead to the so-called multiple election paradoxes as soon as voters' preferences are not separable; or allow voters to express their full preferences on the set of all combinations of values, which is practically impossible as soon as the number of issues and/or the size of the domains are more than a few units. We try to reconciliate both views and find a middle way, by relaxing the extremely demanding separability restriction into this much more reasonable one: there exists a linear order on the set of issues such that for each voter, every issue is preferentially independent of given . This leads us to define a family of sequential voting rules, defined as the sequential composition of local voting rules. These rules relate to the setting of conditional preference networks (CP-nets) recently developed in the Artificial Intelligence literature. Lastly, we study in detail how these sequential rules inherit, or do not inherit, the properties of their local components.
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.:
- Plott, Charles R & Levine, Michael E, 1978.
"A Model of Agenda Influence on Committee Decisions,"
American Economic Review,
American Economic Association, vol. 68(1), pages 146-160, March.
- Plott, Charles R. & Levine, Michael E., "undated". "A Model of Agenda Influence on Committee Decisions," Working Papers 143, California Institute of Technology, Division of the Humanities and Social Sciences.
- Bradley, W. James & Hodge, Jonathan K. & Kilgour, D. Marc, 2005. "Separable discrete preferences," Mathematical Social Sciences, Elsevier, vol. 49(3), pages 335-353, May.
- Brams, Steven J. & Kilgour, D. Marc & Zwicker, William, 1997. "Voting on Referenda: The Separability Problem and Possible Solutions," Working Papers 97-15, C.V. Starr Center for Applied Economics, New York University.
- Brams, Steven J. & Kilgour, D. Marc & Zwicker, William S., 1996.
"The Paradox of Multiple Elections,"
96-09, C.V. Starr Center for Applied Economics, New York University.
- Gilbert Laffond & Jean Lainé & Jean-François Laslier, 1996. "Composition-consistent tournament solutions and social choice functions," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 13(1), pages 75-93, January.
- Marco Scarsini, 1998.
"A strong paradox of multiple elections,"
- W. M. Gorman, 1968. "The Structure of Utility Functions," Review of Economic Studies, Oxford University Press, vol. 35(4), pages 367-390.
- Michel Le Breton & Arunava Sen, 1999. "Separable Preferences, Strategyproofness, and Decomposability," Econometrica, Econometric Society, vol. 67(3), pages 605-628, May.
- Hodge, Jonathan K. & TerHaar, Micah, 2008. "Classifying interdependence in multidimensional binary preferences," Mathematical Social Sciences, Elsevier, vol. 55(2), pages 190-204, March.
- İpek Özkal-Sanver & M. Sanver, 2006. "Ensuring Pareto Optimality by Referendum Voting," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 27(1), pages 211-219, August.
When requesting a correction, please mention this item's handle: RePEc:eee:matsoc:v:57:y:2009:i:3:p:304-324. 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: (Dana Niculescu)
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.