基于广泛博弈的理性多方信息交换模型

Alberto M. Campos, Viet Pham
{"title":"基于广泛博弈的理性多方信息交换模型","authors":"Alberto M. Campos, Viet Pham","doi":"10.1109/ICMCIS.2016.7496539","DOIUrl":null,"url":null,"abstract":"It is well known that excessive intelligence is mandatory in military procedures, in companies to know about competitors, as well as in markets to decide where to invest in. However, this information is not always fully reliable since it might be given by others with conflicting interests. Consequently, there is no guarantee that the supplied information has not been maliciously crafted to produce negative outputs to the receiving entity. For a formal treatment, a way to represent this problem is via Multi-Party Information Exchange (MPIE) model. Applying extensive games, we propose a MPIE when the information is relayed in non-secret channels. This is a refinement of a previous MPIE by rejecting solutions arisen from empty threats, through finding perfect equilibria in sub-games. The resolution to find such perfect equilibria is based on executing an algorithm that solves Mixed Integer Linear Programming (MILP) models. The case studies prove that empty threats are deleted and that a large number of players can be efficiently solved using the proposed algorithm.","PeriodicalId":103155,"journal":{"name":"2016 International Conference on Military Communications and Information Systems (ICMCIS)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A rational multiparty information exchange model using extensive games\",\"authors\":\"Alberto M. Campos, Viet Pham\",\"doi\":\"10.1109/ICMCIS.2016.7496539\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is well known that excessive intelligence is mandatory in military procedures, in companies to know about competitors, as well as in markets to decide where to invest in. However, this information is not always fully reliable since it might be given by others with conflicting interests. Consequently, there is no guarantee that the supplied information has not been maliciously crafted to produce negative outputs to the receiving entity. For a formal treatment, a way to represent this problem is via Multi-Party Information Exchange (MPIE) model. Applying extensive games, we propose a MPIE when the information is relayed in non-secret channels. This is a refinement of a previous MPIE by rejecting solutions arisen from empty threats, through finding perfect equilibria in sub-games. The resolution to find such perfect equilibria is based on executing an algorithm that solves Mixed Integer Linear Programming (MILP) models. The case studies prove that empty threats are deleted and that a large number of players can be efficiently solved using the proposed algorithm.\",\"PeriodicalId\":103155,\"journal\":{\"name\":\"2016 International Conference on Military Communications and Information Systems (ICMCIS)\",\"volume\":\"106 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-05-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 International Conference on Military Communications and Information Systems (ICMCIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICMCIS.2016.7496539\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Conference on Military Communications and Information Systems (ICMCIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMCIS.2016.7496539","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

众所周知,在军事程序中,在公司中了解竞争对手,以及在决定投资地点的市场中,过度的情报是强制性的。然而,这些信息并不总是完全可靠的,因为它可能是由利益冲突的其他人提供的。因此,不能保证所提供的信息没有被恶意制作,从而向接收实体产生负面输出。对于一种正式的处理方法,可以通过多方信息交换(MPIE)模型来表示这个问题。在广泛博弈的基础上,提出了在非保密信道中传输信息时的MPIE。这是对之前的MPIE的改进,通过寻找子博弈中的完美平衡,拒绝了由空洞威胁产生的解决方案。找到这种完美平衡点的方法是基于执行一个求解混合整数线性规划(MILP)模型的算法。实例研究表明,该算法能够有效地消除空威胁,并能有效地求解大量的玩家。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A rational multiparty information exchange model using extensive games
It is well known that excessive intelligence is mandatory in military procedures, in companies to know about competitors, as well as in markets to decide where to invest in. However, this information is not always fully reliable since it might be given by others with conflicting interests. Consequently, there is no guarantee that the supplied information has not been maliciously crafted to produce negative outputs to the receiving entity. For a formal treatment, a way to represent this problem is via Multi-Party Information Exchange (MPIE) model. Applying extensive games, we propose a MPIE when the information is relayed in non-secret channels. This is a refinement of a previous MPIE by rejecting solutions arisen from empty threats, through finding perfect equilibria in sub-games. The resolution to find such perfect equilibria is based on executing an algorithm that solves Mixed Integer Linear Programming (MILP) models. The case studies prove that empty threats are deleted and that a large number of players can be efficiently solved using the proposed algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Delay analysis of STDMA in grid wireless sensor networks Assisted content-based labelling and classification of documents Assessing NATO policy alignment through text analysis: An initial study Learning multi-channel power allocation against smart jammer in cognitive radio networks A novel OFDM sensing method based on CAF-max for hybrid detectors architecture
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1