计算共同先验

IF 0.8 4区管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Operations Research Letters Pub Date : 2024-05-31 DOI:10.1016/j.orl.2024.107134

Marianna E.-Nagy , Miklós Pintér

{"title":"计算共同先验","authors":"Marianna E.-Nagy , Miklós Pintér","doi":"10.1016/j.orl.2024.107134","DOIUrl":null,"url":null,"abstract":"<div><p>Morris (1994) and Feinberg (2000) showed that a finite type space admits a common prior if and only if there is no agreeable bet in it.</p><p>We also consider finite type spaces and observe that the problem of computing a common prior is equivalent to considering the intersection of affine spaces spanned by the types of a player. Therefore, we can apply the Fredholm alternative and conclude that the computational complexity of computing a common prior is strongly polynomial.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"55 ","pages":"Article 107134"},"PeriodicalIF":0.8000,"publicationDate":"2024-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Computing a common prior\",\"authors\":\"Marianna E.-Nagy , Miklós Pintér\",\"doi\":\"10.1016/j.orl.2024.107134\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Morris (1994) and Feinberg (2000) showed that a finite type space admits a common prior if and only if there is no agreeable bet in it.</p><p>We also consider finite type spaces and observe that the problem of computing a common prior is equivalent to considering the intersection of affine spaces spanned by the types of a player. Therefore, we can apply the Fredholm alternative and conclude that the computational complexity of computing a common prior is strongly polynomial.</p></div>\",\"PeriodicalId\":54682,\"journal\":{\"name\":\"Operations Research Letters\",\"volume\":\"55 \",\"pages\":\"Article 107134\"},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2024-05-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Operations Research Letters\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0167637724000701\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research Letters","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167637724000701","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}

引用次数: 0

摘要

Morris（1994）和 Feinberg（2000）指出，当且仅当有限类型空间中不存在可同意的赌注时，该空间才允许有共同先验。我们也考虑了有限类型空间，并观察到计算共同先验的问题等同于考虑棋手类型所跨仿射空间的交集。因此，我们可以应用弗雷德霍姆替代方案，得出结论：计算共同先验的计算复杂度是强多项式的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Computing a common prior

Morris (1994) and Feinberg (2000) showed that a finite type space admits a common prior if and only if there is no agreeable bet in it.

We also consider finite type spaces and observe that the problem of computing a common prior is equivalent to considering the intersection of affine spaces spanned by the types of a player. Therefore, we can apply the Fredholm alternative and conclude that the computational complexity of computing a common prior is strongly polynomial.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Operations Research Letters 管理科学-运筹学与管理科学

CiteScore

2.10

自引率

9.10%

发文量

111

审稿时长

83 days

期刊介绍： Operations Research Letters is committed to the rapid review and fast publication of short articles on all aspects of operations research and analytics. Apart from a limitation to eight journal pages, quality, originality, relevance and clarity are the only criteria for selecting the papers to be published. ORL covers the broad field of optimization, stochastic models and game theory. Specific areas of interest include networks, routing, location, queueing, scheduling, inventory, reliability, and financial engineering. We wish to explore interfaces with other fields such as life sciences and health care, artificial intelligence and machine learning, energy distribution, and computational social sciences and humanities. Our traditional strength is in methodology, including theory, modelling, algorithms and computational studies. We also welcome novel applications and concise literature reviews.