图中的封闭路径与投票理论

IF 0.9 4区 经济学 Q3 ECONOMICS
Donald G. Saari
{"title":"图中的封闭路径与投票理论","authors":"Donald G. Saari","doi":"10.1007/s11238-024-09981-z","DOIUrl":null,"url":null,"abstract":"<p>Features of graphs that hinder finding closed paths with particular properties, as represented by the Traveling Salesperson Problem—TSP, are identified for three classes of graphs. Removing these terms leads to a companion graph with identical closed path properties that is easier to analyze. A surprise is that these troubling graph factors are precisely what is needed to analyze certain voting methods, while the companion graph’s terms are what cause voting theory complexities as manifested by Arrow’s Theorem. This means that the seemingly separate goals of analyzing closed paths in graphs and analyzing voting methods are complementary: components of data terms that assist in one of these areas are the source of troubles in the other. Consequences for standard decision methods are in Sects. 2.5, 3.7 and the companion paper (Saari in Theory Decis 91(3):377–402, 2021). The emphasis here is on paths in graphs; incomplete graphs are similarly handled.</p>","PeriodicalId":47535,"journal":{"name":"Theory and Decision","volume":"13 1","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2024-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Closed paths in graphs vs. voting theory\",\"authors\":\"Donald G. Saari\",\"doi\":\"10.1007/s11238-024-09981-z\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Features of graphs that hinder finding closed paths with particular properties, as represented by the Traveling Salesperson Problem—TSP, are identified for three classes of graphs. Removing these terms leads to a companion graph with identical closed path properties that is easier to analyze. A surprise is that these troubling graph factors are precisely what is needed to analyze certain voting methods, while the companion graph’s terms are what cause voting theory complexities as manifested by Arrow’s Theorem. This means that the seemingly separate goals of analyzing closed paths in graphs and analyzing voting methods are complementary: components of data terms that assist in one of these areas are the source of troubles in the other. Consequences for standard decision methods are in Sects. 2.5, 3.7 and the companion paper (Saari in Theory Decis 91(3):377–402, 2021). The emphasis here is on paths in graphs; incomplete graphs are similarly handled.</p>\",\"PeriodicalId\":47535,\"journal\":{\"name\":\"Theory and Decision\",\"volume\":\"13 1\",\"pages\":\"\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Theory and Decision\",\"FirstCategoryId\":\"96\",\"ListUrlMain\":\"https://doi.org/10.1007/s11238-024-09981-z\",\"RegionNum\":4,\"RegionCategory\":\"经济学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"ECONOMICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theory and Decision","FirstCategoryId":"96","ListUrlMain":"https://doi.org/10.1007/s11238-024-09981-z","RegionNum":4,"RegionCategory":"经济学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ECONOMICS","Score":null,"Total":0}
引用次数: 0

摘要

通过旅行推销员问题(Traveling Salesperson Problem-TSP),确定了三类图形中阻碍找到具有特定属性的封闭路径的特征。剔除这些因素后,就能得到具有相同封闭路径特性的伴生图,而且更容易分析。令人惊讶的是,这些令人不安的图因素恰恰是分析某些投票方法所需要的,而伴图的术语则是导致投票理论复杂性的原因,如阿罗定理所示。这意味着,分析图中的封闭路径和分析投票方法这两个看似不同的目标是相辅相成的:在其中一个领域有帮助的数据术语的组成部分,在另一个领域却是问题的根源。对标准决策方法的影响见第 2.5 节、第 3.7 节和第 3.8 节。2.5 节、3.7 节及相关论文(萨里在《理论决策》中的论文 91(3):377-402, 2021 年)。这里的重点是图中的路径;不完整图也有类似的处理方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Closed paths in graphs vs. voting theory

Closed paths in graphs vs. voting theory

Features of graphs that hinder finding closed paths with particular properties, as represented by the Traveling Salesperson Problem—TSP, are identified for three classes of graphs. Removing these terms leads to a companion graph with identical closed path properties that is easier to analyze. A surprise is that these troubling graph factors are precisely what is needed to analyze certain voting methods, while the companion graph’s terms are what cause voting theory complexities as manifested by Arrow’s Theorem. This means that the seemingly separate goals of analyzing closed paths in graphs and analyzing voting methods are complementary: components of data terms that assist in one of these areas are the source of troubles in the other. Consequences for standard decision methods are in Sects. 2.5, 3.7 and the companion paper (Saari in Theory Decis 91(3):377–402, 2021). The emphasis here is on paths in graphs; incomplete graphs are similarly handled.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.60
自引率
0.00%
发文量
62
期刊介绍: The field of decision has been investigated from many sides. However, research programs relevant to decision making in psychology, management science, economics, the theory of games, statistics, operations research, artificial intelligence, cognitive science and analytical philosophy have remained separate. Theory and Decision is devoted to all aspects of decision making belonging to such programs, but addresses also possible cross-fertilizations between these disciplines which would represent effective advances in knowledge. The purpose of the journal is to let the engineering of choice gradually emerge both for individual and for collective decision making. Formalized treatments will be favoured, to the extent that they provide new insights into the issues raised and an appropriate modeling of the situation considered. Due to its growing importance, expermentation in decision making as well as its links to the cognitive sciences will be granted special attention by Theory and Decision. Of particular interest are: Preference and belief modeling, Experimental decision making under risk or under uncertainty, Decision analysis, multicriteria decision modeling, Game theory, negotiation theory, collective decision making, social choice, Rationality, cognitive processes and interactive decision making, Methodology of the decision sciences. Applications to various problems in management and organization science, economics and finance, computer-supported decision schemes, will be welcome as long as they bear on sufficiently general cases. Analysis of actual decision making processes are also relevant topics for the journal, whether pertaining to individual, collective or negotiatory approaches; to private decisions or public policies; to operations or to strategic choices. Officially cited as: Theory Decis
×
引用
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学术官方微信