Majority judgment over a convex candidate space
Name
MJ_ORL.pdf
Description
Accepted version
Size
404.47 KB
Format
Adobe PDF
Checksum (MD5)
b0f9ac5e97a514fd73aad6b86e4722fe
Author(s)
Yan, Chiwei
Swaroop, Prem
Ball, Michael O.
Barnhart, Cynthia
Vaze, Vikrant
Date Issued
July 2019
Journal
Operations Research Letters
Publisher
Elsevier BV
Citation
Yan, Chiwen et al. "Majority judgment over a convex candidate space." Operations Research Letters 47, 4 (July 2019): 317-325 © 2019 Elsevier B.V.
Version
Author's final manuscript
Abstract
Most voting methods can only deal with a finite number of candidates. In practice, there are important voting applications where the candidate space is continuous. We describe a new voting method by extending the Majority Judgment voting and ranking method to handle a continuous candidate space which is modeled as a convex set. We characterize the structure of the winner determination problem and present a practical iterative voting procedure for finding a (or the) winner when voter preferences are unknown.
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Massachusetts Institute of Technology. Department of Civil and Environmental Engineering
Terms of Use
Creative Commons Attribution-NonCommercial-NoDerivs License
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1016/j.orl.2019.04.009
