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.
Condorcet Winners on Bounded and Distributive Lattices
Cardin, Marta
2019-01-01
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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in ARCA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.