Aggregation on a Finite Lattice

Order(2015)

引用 1|浏览7
暂无评分
摘要
In this paper a result of B. Leclerc and B. Monjardet concerning meet-projections in finite congruence-simple atomistic lattices is generalized. We prove that the result remains valid for any finite tolerance-simple lattice; moreover, we extend it to a type of subdirect product of such lattices, introducing the notion of a generalized oligarchy.
更多
查看译文
关键词
Algorithmic decision theory,Consensus theory,Oligarchy,Tolerance,Residuation theory,Classification system
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要