• 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

Robust Winners and Winner Determination Policies under Candidate Uncertainty

Thumbnail
Date
2014
Link to item file
http://www.aaai.org/ocs/index.php/AAAI/AAAI14/paper/view/8648
Dewey
Recherche opérationnelle
Sujet
social choice; voting; possible winners; robust winners; query policies; multi agent systems
Conference name
28th AAAI Conference on Artificial Intelligence
Conference date
07-2014
Conference city
Québec
Conference country
Canada
Book title
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence
Author
Brodley, Carla E.; Stone, Peter
Publisher
AAAI Press
Publisher city
Palo Alto (USA)
Year
2014
Pages number
3155
ISBN
978-1-57735-661-5
URI
https://basepub.dauphine.fr/handle/123456789/16447
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Boutilier, Craig
status unknown
Lang, Jérôme
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Oren, Joel
status unknown
Palacios, Héctor
Type
Communication / Conférence
Item number of pages
1391-1397
Abstract (EN)
We consider voting situations in which some candidates may turn out to be unavailable. When determining availability is costly (e.g., in terms of money, time, or computation), voting prior to determining candidate availability and testing the winner's availability after the vote may be beneficial. However, since few voting rules are robust to candidate deletion, winner determination requires a number of such availability tests. We outline a model for analyzing such problems, defining robust winners relative to potential candidate unavailability. We assess the complexity of computing robust winners for several voting rules. Assuming a distribution over availability, and costs for availability tests/queries, we describe algorithms for computing optimal query policies, which minimize the expected cost of determining true winners.

  • 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.