Preference Restrictions in Computational Social Choice: Recent Progress

Abstract

The goal of this short paper is to provide an overview of recent progress in understanding and exploiting useful properties of restricted preference domains, such as, e.g., the domains of single-peaked, single-crossing and 1-Euclidean preferences. PDF

Cite

Text

Elkind et al. "Preference Restrictions in Computational Social Choice: Recent Progress." International Joint Conference on Artificial Intelligence, 2016.

Markdown

[Elkind et al. "Preference Restrictions in Computational Social Choice: Recent Progress." International Joint Conference on Artificial Intelligence, 2016.](https://mlanthology.org/ijcai/2016/elkind2016ijcai-preference/)

BibTeX

@inproceedings{elkind2016ijcai-preference,
  title     = {{Preference Restrictions in Computational Social Choice: Recent Progress}},
  author    = {Elkind, Edith and Lackner, Martin and Peters, Dominik},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2016},
  pages     = {4062-4065},
  url       = {https://mlanthology.org/ijcai/2016/elkind2016ijcai-preference/}
}