Judgment aggregation problems are a class of collective decision-making problems represented in an abstract way, subsuming some well known collective decision-making problems such voting problems. A collective decision can be reached either by aggregation of individual decisions or by deliberation -- allowing each decision-maker to change their individual decision in response to the individual decisions the other decision-makers made in the previous step. Impossibility results exist for judgment aggregation operators, voting operators, and judgment deliberation operators. However, while specific aggregation operators were constructed for aggregation of judgments and votes, deliberation procedures have only been studied for voting problems. Here we propose a deliberation procedure for judgment aggregation, based on movements in an undirected graph, and we study for which instances it produces a consensus. We also compare the computational complexity of our deliberation procedure with that of related judgment aggregation operators.
from cs.AI updates on arXiv.org http://ift.tt/1YJEOuu
via IFTTT
No comments:
Post a Comment