Loading...
Loading...

Go to the content (press return)

Algorithmically efficient syntactic characterization of possibility domains

Author
Diaz, J.; Kirousis, L.; Kokonezi, S.; Livieratos, J.
Type of activity
Report
Date
2019-01-01
Project funding
Graph-based Models and Methods for Computing in the Large
URL
https://arxiv.org/abs/1901.00138 Open in new window
Abstract
We call domain any arbitrary subset of a Cartesian power of the set {0,1} when we think of it as reflecting abstract rationality restrictions on vectors of two-valued judgments on a number of issues. In Computational Social Choice Theory, and in particular in the theory of judgment aggregation, a domain is called a possibility domain if it admits a non-dictatorial aggregator, i.e. if for some k there exists a unanimous (idempotent) function F:Dk¿D which is not a projection function. We prove th...
Keywords
Algorithm Complexity, Collective Decision Making, Computational Social Choice, Judgment Aggre-gation, Logical Relations
Group of research
ALBCOM - Algorithms, Computational Biology, Complexity and Formal Methods

Participants

  • Diaz Cort, Jose Maria  (author)
  • Kirousis, Lefteris  (author)
  • Kokonezi, Sofia  (author)
  • Livieratos, John  (author)