A cost-effective framework for preference elicitation and aggregation

We propose a cost-effective framework for preference elicitation and aggregation under the Plackett-Luce model with features. Given a budget, our framework iteratively computes the most cost-effective elicitation questions in order to help the agents make a better group decision. 
We illustrate the viability of the framework with experiments on Amazon Mechanical Turk, which we use to estimate the cost of answering different types of elicitation questions. We compare the prediction accuracy of our framework when adopting various information criteria that evaluate the expected information gain from a question. Our experiments show carefully designed information criteria are much more efficient, i.e., they arrive at the correct answer using fewer queries, than randomly asking questions given the budget constraint.


Zhibing Zhao, Haoming Li, Junming Wang, Jeffrey O. Kephart, Nicholas Mattei, Hui Su, Lirong Xia, "A cost-effective framework for preference elicitation and aggregation,"

Proceedings of the Conference on Uncertainty in Artificial Intelligence (UAI) 2018, pp 446-456


  author    = {Zhibing Zhao and
               Haoming Li and
               Junming Wang and
               Jeffrey O. Kephart and
               Nicholas Mattei and
               Hui Su and
               Lirong Xia},
  title     = {A Cost-Effective Framework for Preference Elicitation and Aggregation},
  journal   = {CoRR},
  volume    = {abs/1805.05287},
  year      = {2018},
  url       = {http://arxiv.org/abs/1805.05287},
  archivePrefix = {arXiv},
  eprint    = {1805.05287},
  timestamp = {Fri, 12 Jul 2019 07:30:41 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1805-05287},
  bibsource = {dblp computer science bibliography, https://dblp.org}