Search arXivSearch

arXiv · 1701.08652

On the Number of Single-Peaked Narcissistic or Single-Crossing Narcissistic Preference Profiles

Abstract

We investigate preference profiles for a set $\mathcal{V}$ of voters, where each voter $i$ has a preference order $\succ_i$ on a finite set $A$ of alternatives (that is, a linear order on $A$) such that for each two alternatives $a,b\in A$, voter $i$ prefers $a$ to $b$ if $a\succ_i b$. Such a profile is narcissistic if each alternative $a$ is preferred the most by at least one voter. It is single-peaked if there is a linear order $\triangleright^{\text{sp}}$ on the alternatives such that each voter's preferences on the alternatives along the order $\triangleright^{\text{sp}}$ are either strictly increasing, or strictly decreasing, or first strictly increasing and then strictly decreasing. It is single-crossing if there is a linear order $\triangleright^{\text{sc}}$ on the voters such that each pair of alternatives divides the order $\triangleright^{\text{sc}}$ into at most two suborders, where in each suborder, all voters have the same linear order on this pair. We show that for $n$ voters and $n$ alternatives,the number of single-peaked narcissistic profiles is $\prod_{i=2}^{n-1} \binom{n-1}{i-1}$ while the number of single-crossing narcissistic profiles is $2^{\binom{n-1}{2}}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiehua Chen, Ugo P. Finnendahl. 2018-01-08. On the Number of Single-Peaked Narcissistic or Single-Crossing Narcissistic Preference Profiles. https://arxiv.org/abs/1701.08652

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO