Necessary and possible winners for top-cycles from preferences allowing ties and tentative incompleteness
AbstractIn 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 InfoIf 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.
Bibliographic InfoPaper provided by CEREGMIA, Université des Antilles et de la Guyane in its series Documents de Travail with number 2013-03.
Length: 25 pages
Date of creation: Jan 2013
Date of revision:
Contact details of provider:
Postal: Campus de Schoelcher, B.P. 7209, 97275 Schoelcher Cedex
Web page: http://www.ceregmia.eu/
More information through EDIRC
This paper has been announced in the following NEP Reports:
- NEP-ALL-2013-03-02 (All new papers)
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.:
- 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.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Janis Hilaricus).
If references are entirely missing, you can add them using this form.