• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Simultaneous Elicitation of Committee and Voters' Preferences

Thumbnail
Date
2019
Link to item file
https://hal.archives-ouvertes.fr/hal-02160455
Dewey
Intelligence artificielle
Sujet
Computational Social Choice; uncertainty in AI; minimax regret; preference elicitation
Conference name
Rencontres des Jeunes Chercheurs en Intelligence Artificielle 2019
Conference date
07-2019
Conference city
Toulouse
Conference country
France
Book title
Actes des 17èmes Rencontres des Jeunes Chercheurs en Intelligence Artificielle (RJCIA 2019)
Author
Lefrançois, Maxime
Publisher
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
URI
https://basepub.dauphine.fr/handle/123456789/21186
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Napolitano, Beatrice
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Cailloux, Olivier
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Viappiani, Paolo
Type
Communication / Conférence
Item number of pages
59-62
Abstract (EN)
Social choice deals with the problem of determining a consensus choice from the preferences of different voters. In the classical setting, the voting rule is fixed beforehand and full information concerning he preferences of the voters is provided. Recently, the assumption of full preference information has been questioned by a number of researchers and several methods for eliciting preferences have been proposed. In this paper we go one step further and we assume that both the voting rule and the voters’ preferences are partially specified. In this setting, we present an interactive elicitation protocol based on minimax regret and develop several query strategies that interleave questions to the chair and questions to the voters in order to attempt to acquire the most relevant information in order to quickly converge to optimal or a near-optimal alternative.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.