Iterative judgment aggregation

DOI10.3233/978-1-61499-672-9-1528zbMATH Open1396.91094arXiv1604.06356OpenAlexW4297817824MaRDI QIDQ4576261FDOQ4576261

Publication date: 12 July 2018

Abstract: Judgment aggregation problems form a class of collective decision-making problems represented in an abstract way, subsuming some well known problems such as voting. A collective decision can be reached in many ways, but a direct one-step aggregation of individual decisions is arguably most studied. Another way to reach collective decisions is by iterative consensus building -- allowing each decision-maker to change their individual decision in response to the choices of the other agents until a consensus is reached. Iterative consensus building has so far only been studied for voting problems. Here we propose an iterative judgment aggregation algorithm, based on movements in an undirected graph, and we study for which instances it terminates with a consensus. We also compare the computational complexity of our iterative procedure with that of related judgment aggregation operators.

Full work available at URL: https://arxiv.org/abs/1604.06356

Recommendations

zbMATH Keywords

collective decision-making iterative consensus building iterative judgment aggregation social choice aggregation

Mathematics Subject Classification ID

Applications of graph theory (05C90) Decision theory (91B06) Social choice (91B14) Analysis of algorithms and problem complexity (68Q25)

Cited In (3)

This page was built for publication: Iterative judgment aggregation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4576261)