大型选举中的近似单峰性

Zhihuai Chen, Q. Li, Xiaoming Sun, Lirong Xia, Jialin Zhang
{"title":"大型选举中的近似单峰性","authors":"Zhihuai Chen, Q. Li, Xiaoming Sun, Lirong Xia, Jialin Zhang","doi":"10.1109/ICBK50248.2020.00068","DOIUrl":null,"url":null,"abstract":"Single-peaked preferences are a natural way to avoid paradoxes and impossibility theorems in social choice and have recently been involved in the study of various computational aspects of social choice. Since strict single-peakedness is hard to achieve in practice, approximate single-peakedness appears more appropriate and is gaining popularity. In this paper, we study approximate single-peakedness of large, randomly-generated profiles. We focused on characterizing the asymptotically optimal social axis, which is asymptotically consistent with most agents’ preferences generated from a statistical model. We characterize all asymptotically optimal social axes under the Mallows model for two case: the case where the dispersion parameter $\\varphi$ is close to 0, and the case where $\\varphi$ is close to 1. We also design an algorithm to help characterize all asymptotically optimal social axes for all $\\varphi$ when the number of alternative is no more than 10. These results help us understand the structure of approximate single-peakedness in large elections.","PeriodicalId":432857,"journal":{"name":"2020 IEEE International Conference on Knowledge Graph (ICKG)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Approximate Single-Peakedness in Large Elections\",\"authors\":\"Zhihuai Chen, Q. Li, Xiaoming Sun, Lirong Xia, Jialin Zhang\",\"doi\":\"10.1109/ICBK50248.2020.00068\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Single-peaked preferences are a natural way to avoid paradoxes and impossibility theorems in social choice and have recently been involved in the study of various computational aspects of social choice. Since strict single-peakedness is hard to achieve in practice, approximate single-peakedness appears more appropriate and is gaining popularity. In this paper, we study approximate single-peakedness of large, randomly-generated profiles. We focused on characterizing the asymptotically optimal social axis, which is asymptotically consistent with most agents’ preferences generated from a statistical model. We characterize all asymptotically optimal social axes under the Mallows model for two case: the case where the dispersion parameter $\\\\varphi$ is close to 0, and the case where $\\\\varphi$ is close to 1. We also design an algorithm to help characterize all asymptotically optimal social axes for all $\\\\varphi$ when the number of alternative is no more than 10. These results help us understand the structure of approximate single-peakedness in large elections.\",\"PeriodicalId\":432857,\"journal\":{\"name\":\"2020 IEEE International Conference on Knowledge Graph (ICKG)\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE International Conference on Knowledge Graph (ICKG)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICBK50248.2020.00068\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE International Conference on Knowledge Graph (ICKG)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICBK50248.2020.00068","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

单峰偏好是避免社会选择中悖论和不可能定理的一种自然方式,最近被用于社会选择的各种计算方面的研究。由于严格的单峰在实践中很难实现,近似单峰显得更为合适,并且越来越受欢迎。在本文中,我们研究了随机生成的大型剖面的近似单峰性。我们专注于描述渐近最优社会轴,它与统计模型生成的大多数代理的偏好渐近一致。我们在两种情况下描述了Mallows模型下的所有渐近最优社会轴:离散参数$\varphi$接近于0的情况,以及$\varphi$接近于1的情况。我们还设计了一种算法来帮助描述所有$\varphi$的渐近最优社会轴,当选项的数量不超过10时。这些结果有助于我们理解大型选举中近似单峰的结构。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Approximate Single-Peakedness in Large Elections
Single-peaked preferences are a natural way to avoid paradoxes and impossibility theorems in social choice and have recently been involved in the study of various computational aspects of social choice. Since strict single-peakedness is hard to achieve in practice, approximate single-peakedness appears more appropriate and is gaining popularity. In this paper, we study approximate single-peakedness of large, randomly-generated profiles. We focused on characterizing the asymptotically optimal social axis, which is asymptotically consistent with most agents’ preferences generated from a statistical model. We characterize all asymptotically optimal social axes under the Mallows model for two case: the case where the dispersion parameter $\varphi$ is close to 0, and the case where $\varphi$ is close to 1. We also design an algorithm to help characterize all asymptotically optimal social axes for all $\varphi$ when the number of alternative is no more than 10. These results help us understand the structure of approximate single-peakedness in large elections.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信