On the number of single-peaked narcissistic or single-crossing narcissistic preference profiles.

Discrete Mathematics(2018)

引用 12|浏览20
暂无评分
摘要
We investigate preference profiles for a set V of voters, where each voter i has a preference order ≻i on a finite set A of alternatives (that is, a linear order on A) such that for each two alternatives  a,b∈A, voter i prefers a to b if a≻ib. 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 ▹sp on the alternatives such that each voter’s preferences on the alternatives along the order ▹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 ▹sc on the voters such that each pair of alternatives divides the order ▹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 ∏i=2n−1n−1i−1 while the number of single-crossing narcissistic profiles is 2n−12.
更多
查看译文
关键词
Narcissistic preferences,Single-peaked preferences,Single-crossing preferences,Semi-standard Young tableaux
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要