754. Symmetric Consequence Relations and Strategy-Proof Judgment Aggregation

Working paper N. 754 Maggio 2017

Stefano Vannucci

DEPS, USiena

Abstract

It is shown that the posets of both substructural and

classical symmetric consequence relations ordered by set-inclusion are (non-boolean) completely distributive complete lattices. Therefore, those two basic versions of symmetric consequence relations are amenable to anonymous neutral and idempotent strategy- proof aggregation by majority polynomial rules on single-peaked domains. In particular, the majority rule is characterized as the only aggregation rule for odd profiles of symmetric consequence relations that is anonymous, bi-idempotent and strategy-proof on arbitrary rich locally unimodal domains.
 
Jel Codes
D71