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

Sequential composition of voting rules in multi-issue domains

Contents:

Author Info

  • Lang, Jérôme
  • Xia, Lirong
Registered author(s):

    Abstract

    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 View the MathML source on the set of issues such that for each voter, every issue View the MathML source is preferentially independent of View the MathML source given View the MathML source. 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.

    Download Info

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below under "Related research" whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Bibliographic Info

    Paper provided by Paris Dauphine University in its series Economics Papers from University Paris Dauphine with number 123456789/4020.

    as in new window
    Length:
    Date of creation: May 2009
    Date of revision:
    Publication status: Published in Mathematical Social Sciences, 2009, Vol. 57, no. 3. pp. 304-324.Length: 20 pages
    Handle: RePEc:dau:papers:123456789/4020

    Contact details of provider:
    Web page: http://www.dauphine.fr/en/welcome.html
    More information through EDIRC

    Related research

    Keywords: CP-networks; Preferential independence; Multiple elections; Voting;

    Find related papers by JEL classification:

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    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:dau:papers:123456789/4020. 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: (Alexandre Faure).

    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.