Skip to main content
Conference Proceedings

Condorcet Winners on Bounded and Distributive Lattices

Advances in Intelligent Systems and Computing (2019) 981 339-346
DOI: 10.1007/978-3-030-19494-9_31
0Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Aggregating preferences for finding a consensus between several agents is an important topic in social choice theory. We obtain several axiomatic characterizations of some significant subclasses of voting rules defined on bounded and distributive lattices.

Author supplied keywords

Cite

CITATION STYLE

APA

Cardin, M. (2019). Condorcet Winners on Bounded and Distributive Lattices. In Advances in Intelligent Systems and Computing (Vol. 981, pp. 339–346). Springer Verlag. https://doi.org/10.1007/978-3-030-19494-9_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free