Algorithmically efficient syntactic characterization of possibility domains

MaRDI QIDQ5131261zbMATH OpenFDO

Authors L. M. Kirousis, Sofia. Kokonezi, John Livieratos, J. Díaz

Publication date 5 November 2020

Full work available at URL https://arxiv.org/abs/1901.00138, http://bulletin.math.uoc.gr/vol/63/63-97-135.pdf

zbMATH Keywords

algorithm complexitycollective decision makingcomputational social choicejudgment aggregationlogical relations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decision theory (91B06) Social choice (91B14) Mathematical economics and fuzziness (91B86)

Recommendations

• On the computational complexity of non-dictatorial aggregation
• On the computational complexity of non-dictatorial aggregation
• Majority voting on restricted domains
• Propositionwise judgment aggregation: the general case
• Many-valued judgment aggregation: characterizing the possibility/impossibility boundary

Cites work

• A generalised model of judgment aggregation
• A mathematical introduction to logic.
• A new line of attack on the dichotomy conjecture
• Abstract Arrowian aggregation
• Aggregation of binary evaluations
• Aggregation of binary evaluations for truth-functional agendas
• Aggregation of votes with multiple positions on each issue
• Algorithmically efficient syntactic characterization of possibility domains
• Arrow's theorem in judgment aggregation
• Belief merging and the discursive dilemma: an argument-based account to paradoxes of judgment aggregation
• Conservative constraint satisfaction re-revisited
• Decision framing in judgment aggregation
• Depth-First Search and Linear Graph Algorithms
• How to determine the expressive power of constraints
• scientific article; zbMATH DE number 3972929 (Why is no real title available?)
• scientific article; zbMATH DE number 2021556 (Why is no real title available?)
• Lifting integrity constraints in binary aggregation
• On Cores and Prime Implicants of Truth Functions
• On generating all solutions of generalized satisfiability problems
• On the computational complexity of non-dictatorial aggregation
• On the theory of aggregation
• Renaming a Set of Clauses as a Horn Set
• Structure identification in relational data
• The complexity of satisfiability problems
• The polynomial-time hierarchy
• The satisfiabilty problem for a class consisting of horn sentences and some non-horn sentences in proportional logic
• The theory of judgment aggregation: an introductory review
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)

Cited in

(4)

• On the computational complexity of non-dictatorial aggregation
• Algorithmically efficient syntactic characterization of possibility domains
• On the computational complexity of non-dictatorial aggregation
• Algorithms for sentences over integral domains

This page was built for publication: Algorithmically efficient syntactic characterization of possibility domains

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