Collective combinatorial optimisation as judgment aggregation

DOI10.1007/S10472-023-09910-WMaRDI QIDQ6661052zbMATH OpenFDO

Authors Linus Boes, Rachael Colley, Umberto Grandi, Jérôme Lang, Arianna Novaro

Publication date 10 January 2025

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10472-023-09910-W

zbMATH Keywords

combinatorial optimisationcomputational complexitycomputational social choicejudgment aggregation

Mathematics Subject Classification ID

General topics of discrete mathematics in relation to computer science (68R01) Knowledge representation (68T30)

Cites work

• A partial taxonomy of judgment aggregation rules and their properties
• An efficient mixed integer linear programming model for the minimum spanning tree problem
• Chamberlin-Courant rule with approval ballots: approximating the MaxCover problem with bounded frequencies in FPT time
• Committee selection under weight constraints
• Complexity of manipulative interference in participatory budgeting
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Judgment aggregation
• Lifting integrity constraints in binary aggregation
• Logic based merging
• Maximizing the minimum voter satisfaction on spanning trees
• Multi-winner voting with approval preferences
• The complexity landscape of outcome determination in judgment aggregation
• The Condorcet set: majority voting over interconnected propositions
• The median rule in judgement aggregation

This page was built for publication: Collective combinatorial optimisation as judgment aggregation

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