Symmetric majority rules

Daniela Bubboloni; Michele Gori

Home/Archive/arXiv

arXiv · 1503.04028

Symmetric majority rules

Daniela Bubboloni·Michele Gori

View original source ↗Read source document ↗Export metadata ↓

Abstract

In the standard arrovian framework and under the assumption that individual preferences and social outcomes are linear orders on the set of alternatives, we study the rules which satisfy suitable symmetries and obey the majority principle. In particular, supposing that individuals and alternatives are exogenously partitioned into subcommittees and subclasses, we provide necessary and sufficient conditions for the existence of reversal symmetric majority rules that are anonymous and neutral with respect to the considered partitions. We also determine a general method for constructing and counting those rules and we explicitly apply it to some simple cases.

Explore related subjects

math.GR

Keep this discovery

BibTeX RIS

Daniela Bubboloni, Michele Gori. 2015-03-13. Symmetric majority rules. https://arxiv.org/abs/1503.04028

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR↗

arXiv2026

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR↗

arXiv2026

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR↗