Structure of single-peaked preferences

IF 2.2 4区 心理学 Q2 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS
Alexander Karpov
{"title":"Structure of single-peaked preferences","authors":"Alexander Karpov","doi":"10.1016/j.jmp.2023.102817","DOIUrl":null,"url":null,"abstract":"<div><p>The paper studies a variety of domains of preference orders that are closely related to single-peaked preferences. We develop recursive formulas for the number of single-peaked preference profiles and the number of preference profiles that are single-peaked on a circle. The number of Arrow’s single-peaked preference profiles is found for three, four, and five alternatives. Random sampling applications are discussed. For restricted tier preference profiles, a forbidden subprofiles characterization and an exact enumeration formula are obtained. It is also shown that each Fishburn’s preference profile is single-peaked on a circle preference profile, and Fishburn’s preference profiles cannot be characterized by forbidden subprofiles.</p></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"117 ","pages":"Article 102817"},"PeriodicalIF":2.2000,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Mathematical Psychology","FirstCategoryId":"102","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0022249623000731","RegionNum":4,"RegionCategory":"心理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

The paper studies a variety of domains of preference orders that are closely related to single-peaked preferences. We develop recursive formulas for the number of single-peaked preference profiles and the number of preference profiles that are single-peaked on a circle. The number of Arrow’s single-peaked preference profiles is found for three, four, and five alternatives. Random sampling applications are discussed. For restricted tier preference profiles, a forbidden subprofiles characterization and an exact enumeration formula are obtained. It is also shown that each Fishburn’s preference profile is single-peaked on a circle preference profile, and Fishburn’s preference profiles cannot be characterized by forbidden subprofiles.

单峰偏好的结构
本文研究了与单峰偏好密切相关的各种偏好顺序领域。我们建立了单峰偏好轮廓数和圆上单峰偏好轮廓数的递推公式。我们找到了三个、四个和五个备选方案的阿罗单峰偏好轮廓数。讨论了随机抽样的应用。对于限制层偏好剖面,得到了禁止子剖面特征和精确枚举公式。同时还证明了每个费什伯恩偏好轮廓都是圆偏好轮廓上的单峰,而且费什伯恩偏好轮廓不能用禁止子轮廓来表征。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Mathematical Psychology
Journal of Mathematical Psychology 医学-数学跨学科应用
CiteScore
3.70
自引率
11.10%
发文量
37
审稿时长
20.2 weeks
期刊介绍: The Journal of Mathematical Psychology includes articles, monographs and reviews, notes and commentaries, and book reviews in all areas of mathematical psychology. Empirical and theoretical contributions are equally welcome. Areas of special interest include, but are not limited to, fundamental measurement and psychological process models, such as those based upon neural network or information processing concepts. A partial listing of substantive areas covered include sensation and perception, psychophysics, learning and memory, problem solving, judgment and decision-making, and motivation. The Journal of Mathematical Psychology is affiliated with the Society for Mathematical Psychology. Research Areas include: • Models for sensation and perception, learning, memory and thinking • Fundamental measurement and scaling • Decision making • Neural modeling and networks • Psychophysics and signal detection • Neuropsychological theories • Psycholinguistics • Motivational dynamics • Animal behavior • Psychometric theory
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信