Aggregation of evaluations without unanimity
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3162893 (Why is no real title available?)
- scientific article; zbMATH DE number 7359806 (Why is no real title available?)
- scientific article; zbMATH DE number 7561550 (Why is no real title available?)
- A quantitative Arrow theorem
- Aggregation of binary evaluations
- Aggregation of binary evaluations for truth-functional agendas
- Aggregation of binary evaluations with abstentions
- Aggregation of equivalence relations
- Aggregation of non-binary evaluations
- Algebraic Approach to Promise Constraint Satisfaction
- Algebraic aggregation theory
- An algebraic approach to multi-sorted constraints
- Arrow's theorem in judgment aggregation
- Closed systems of functions and predicates
- Complexity of conservative constraint satisfaction problems
- Conservative constraint satisfaction re-revisited
- Galois theory for minors of finite functions
- Intransitive social indifference and the Arrow dilemma
- Multisorted Boolean clones determined by binary relations up to minion homomorphisms
- New hardness results for graph and hypergraph colorings
- Promise constraint satisfaction: algebraic structure and a symmetric Boolean dichotomy
- Propositionwise judgment aggregation: the general case
- Reflections on and of minor-closed classes of multisorted operations
- The Lean 4 theorem prover and programming language
- The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
- The complexity of satisfiability problems
- The lattice of all clones of self-dual functions in three-valued logic
- (2+)-Sat is NP-hard
This page was built for publication: Aggregation of evaluations without unanimity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7253580)
