Aggregation on a finite lattice
From MaRDI portal
Publication:2520714
DOI10.1007/s11083-015-9373-9zbMath1403.06007OpenAlexW1940095798MaRDI QIDQ2520714
Melvin F. Janowitz, Sándor Radeleczki
Publication date: 16 December 2016
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11083-015-9373-9
toleranceresiduation theoryconsensus theoryalgorithmic decision theoryoligarchyclassification system
Decision theory (91B06) Complete lattices, completions (06B23) Lattice ideals, congruence relations (06B10)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The lattice of quasiorder lattices of algebras on a finite set.
- Separability and aggregation of equivalence relations
- Rules for aggregating information
- On a dependence relation in finite lattices
- Arrowian characterizations of latticial federation consensus functions
- Intervals in lattices of quasiorders
- Aggregation and residuation
- The structure of relatively complemented lattices
- Lattice Theory: Foundation
- Tolerances and congruences on lattices
- Characterizations of Finite Lattices that are Bounded-Homomqrphic Images or Sublattices of Free Lattices
- Tolerances, interval orders, and semiorders
- Classification systems and their lattice
- Axiomatic Consensus Theory in Group Choice and Biomathematics
- Some Observations on Oligarchies, Internal Direct Sums, and Lattice Congruences
- Decreasing Baer semigroups
- Extent partitions and context extensions
This page was built for publication: Aggregation on a finite lattice