{"type":"ScholarlyArticle","title":"Efficient Vote Elicitation under Candidate Uncertainty","authors":[{"name":"Joel Oren","slug":"joel-oren","given":"Joel","family":"Oren","affiliation":""},{"name":"Yuval Filmus","slug":"yuval-filmus","given":"Yuval","family":"Filmus","affiliation":""},{"name":"Craig Boutilier","slug":"craig-boutilier","given":"Craig","family":"Boutilier","affiliation":""}],"abstract":"Top-k voting is an especially natural form of partial vote elicitation in which only length k prefixes of rankings are elicited. We analyze the ability of top-k vote elicitation to correctly determine true winners, with high probability, given probabilistic models of voter preferences and candidate availability. We provide bounds on the minimal value of k required to determine the correct winner under the plurality and Borda voting rules, considering both worst-case preference profiles and profiles drawn from the impartial culture and Mallows probabilistic models. We also derive conditions under which the special case of zero-elicitation (i.e., k = 0) produces the correct winner. We provide empirical results that confirm the value of top-k voting.","doi":null,"url":"https://ijcai.org/proceedings/2013/54","pdf":"https://ijcai.org/proceedings/2013/0054.pdf","markdown":"https://ijcai.org/proceedings/2013/54.md","bibtex":"https://ijcai.org/proceedings/2013/bibtex/54","volume":{"slug":"2013","title":"Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2013","url":"https://ijcai.org/proceedings/2013/","year":2013,"location":"Beijing, China","dates":"3–9 August 2013","editors":"Francesca Rossi","isbn":"978-1-57735-633-2","publisher":"AAAI Press / International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":54,"pages":{"first":309,"last":315},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}