Voting on multi-issue domains with conditionally lexicographic preferences
| Autor: | Jérôme Lang, Lirong Xia, Jérôme Mengin |
|---|---|
| Přispěvatelé: | Centre National de la Recherche Scientifique - CNRS (FRANCE), Institut National Polytechnique de Toulouse - INPT (FRANCE), Rensselaer Polytechnic Institute - RPI (USA), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Université Paris-Dauphine (FRANCE), PSL Research University (FRANCE), Institut de Recherche en Informatique de Toulouse - IRIT (Toulouse, France), Université Paris Dauphine-PSL, Université Paris sciences et lettres (PSL), Argumentation, Décision, Raisonnement, Incertitude et Apprentissage (IRIT-ADRIA), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Rensslaer Polytechnic Institute, USA, Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE) |
| Jazyk: | angličtina |
| Rok vydání: | 2018 |
| Předmět: |
Linguistics and Language
Computational complexity theory Computer science media_common.quotation_subject 0102 computer and information sciences 02 engineering and technology Lexicographic preferences 01 natural sciences Maximum satisfiability Language and Linguistics [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI] Artificial Intelligence Voting 0202 electrical engineering electronic engineering information engineering Natural (music) Representation (mathematics) Preference (economics) media_common Winner determination Computational social choice Intelligence artificielle 16. Peace & justice 010201 computation theory & mathematics Maximum satisfiability problem Multi issue 020201 artificial intelligence & image processing Mathematical economics |
| Zdroj: | Artificial Intelligence Artificial Intelligence, Elsevier, 2018, 265, pp.18-44. ⟨10.1016/j.artint.2018.05.004⟩ |
| ISSN: | 0004-3702 |
| DOI: | 10.1016/j.artint.2018.05.004⟩ |
| Popis: | International audience; One approach to voting on several interrelated issues consists in using a language for compact preference representation, from which the voters' preferences are elicited and aggregated. Such a language can usually be seen as a domain restriction. We consider a well-known restriction, namely, conditionally lexicographic preferences , where both the relative importance between issues and the preference between the values of an issue may depend on the values taken by more important issues. The naturally associated language consists in describing conditional importance and conditional preference by trees together with conditional preference tables. In this paper, we study the aggregation of conditionally lexicographic preferences for several common voting rules and several classes of lexicographic preferences. We address the computation of the winning alternative for some important rules, both by identifying the computational complexity of the relevant problems and by showing that for several of them, computing the winner reduces in a very natural way to a maxsat problem |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect