游戏,欺骗和琼斯引理

Zachariah E. Fuchs, P. Khargonekar
{"title":"游戏,欺骗和琼斯引理","authors":"Zachariah E. Fuchs, P. Khargonekar","doi":"10.1109/ACC.2011.5991297","DOIUrl":null,"url":null,"abstract":"Deception is pervasive in adversarial situations. Here we present a formulation of deception using a two-player game setting. One of the two players deploys a sensor network to gather information on the opponent who in turn can employ deception tactics. We solve the resulting general game using linear programs. We pose an illustrative example and develop closed form solutions for special cases. Finally, we show how our solutions capture the well-known \"Jones' Lemma\" from the deception literature.","PeriodicalId":225201,"journal":{"name":"Proceedings of the 2011 American Control Conference","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Games, deception, and Jones' Lemma\",\"authors\":\"Zachariah E. Fuchs, P. Khargonekar\",\"doi\":\"10.1109/ACC.2011.5991297\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Deception is pervasive in adversarial situations. Here we present a formulation of deception using a two-player game setting. One of the two players deploys a sensor network to gather information on the opponent who in turn can employ deception tactics. We solve the resulting general game using linear programs. We pose an illustrative example and develop closed form solutions for special cases. Finally, we show how our solutions capture the well-known \\\"Jones' Lemma\\\" from the deception literature.\",\"PeriodicalId\":225201,\"journal\":{\"name\":\"Proceedings of the 2011 American Control Conference\",\"volume\":\"48 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-08-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2011 American Control Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACC.2011.5991297\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2011 American Control Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACC.2011.5991297","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

在敌对的情况下,欺骗是普遍存在的。在这里,我们提出了一个使用两人博弈设置的欺骗公式。其中一名玩家部署了一个传感器网络来收集对手的信息,而对手又可以使用欺骗战术。我们用线性规划求解得到的一般对策。我们提出了一个说明性的例子,并开发了特殊情况下的封闭形式解。最后,我们展示了我们的解决方案如何从欺骗文献中捕获著名的“琼斯引理”。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Games, deception, and Jones' Lemma
Deception is pervasive in adversarial situations. Here we present a formulation of deception using a two-player game setting. One of the two players deploys a sensor network to gather information on the opponent who in turn can employ deception tactics. We solve the resulting general game using linear programs. We pose an illustrative example and develop closed form solutions for special cases. Finally, we show how our solutions capture the well-known "Jones' Lemma" from the deception literature.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信