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

Necessary and possible winners for top-cycles from preferences allowing ties and tentative incompleteness

Contents:

Author Info

  • Rémy-Robert Joseph

    ()
    (Université des Antilles et de la Guyane (UAG), CEREGMIA, IUT de Kourou)

Abstract

In autonomous multiagent systems, collective choices among several proposed alternatives are made with the use of voting procedures such as the majority rule. When the elicitation of the agents’ preferences is incomplete but tentative, collective choice procedures commonly aggregate available individual preferences into an incomplete binary relation. From this relation, we can assess the Condorcet winner (the best alternative) if it exists, or, more generally, a choice set (the best compromise solution), by identifying alternatives that are able to be eligible (possible winners) and those that are definitely among the future chosen alternatives (necessary winners). In this context, here we characterise the possible and necessary winner sets for three choice sets: The weak top-cycle (or Smith-set), strong top-cycle (or Schwartz-set) and rational topcycle. We also introduce linear and quadratic time algorithms for computing the necessary winners for the three top-cycles and the possible winners for the weak and strong top-cycles. Finally, we propose efficient heuristics for finding a subset and a superset of possible winners for the rational top-cycle, with its computational tractability staying an open question.

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://www2.univ-ag.fr/RePEc/DT/DT2013-03_Joseph.pdf
File Function: First version, 2013
Download Restriction: no

Bibliographic Info

Paper provided by CEREGMIA, Université des Antilles et de la Guyane in its series Documents de Travail with number 2013-03.

as in new window
Length: 25 pages
Date of creation: Jan 2013
Date of revision:
Handle: RePEc:crg:wpaper:dt2013-03

Contact details of provider:
Postal: Campus de Schoelcher, B.P. 7209, 97275 Schoelcher Cedex
Phone: 05.96.72.74.00
Fax: 05.96.72.74.03
Email:
Web page: http://www.ceregmia.eu/
More information through EDIRC

Related research

Keywords:

This paper has been announced in the following NEP Reports:

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. Fortemps, Philippe & Greco, Salvatore & Slowinski, Roman, 2008. "Multicriteria decision support using rules that represent rough-graded preference relations," European Journal of Operational Research, Elsevier, Elsevier, vol. 188(1), pages 206-223, July.
Full references (including those not matched with items on IDEAS)

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:crg:wpaper:dt2013-03. 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: (Janis Hilaricus).

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.