On the Tree Representations of Dichotomous Preferences

IJCAI 2019 pp. 644-650

doi:10.24963/IJCAI.2019/91 /ijcai/2019/yang2019ijcai-tree/

Abstract

We study numerous restricted domains of dichotomous preferences with respect to some tree structures. Particularly, we study the relationships among these domains and the ones proposed by Elkind and Lackner [2015]. We also show that recognizing all the restricted domains proposed in this paper is polynomial-time solvable. Finally, we explore the complexity of winner determination for several important approval-based multiwinner voting rules when restricted to these domains.

PDF IJCAI Semantic Scholar

Cite

Text

Yang. "On the Tree Representations of Dichotomous Preferences." International Joint Conference on Artificial Intelligence, 2019. doi:10.24963/IJCAI.2019/91

Markdown

[Yang. "On the Tree Representations of Dichotomous Preferences." International Joint Conference on Artificial Intelligence, 2019.](https://mlanthology.org/ijcai/2019/yang2019ijcai-tree/) doi:10.24963/IJCAI.2019/91

BibTeX

@inproceedings{yang2019ijcai-tree,
  title     = {{On the Tree Representations of Dichotomous Preferences}},
  author    = {Yang, Yongjie},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2019},
  pages     = {644-650},
  doi       = {10.24963/IJCAI.2019/91},
  url       = {https://mlanthology.org/ijcai/2019/yang2019ijcai-tree/}
}