网络延迟博弈的幂等算法的发展

SIAM Conf. on Control and its Applications Pub Date : 1900-01-01 DOI:10.1137/1.9781611974072.60

W. McEneaney, Amit P. Pandey

{"title":"网络延迟博弈的幂等算法的发展","authors":"W. McEneaney, Amit P. Pandey","doi":"10.1137/1.9781611974072.60","DOIUrl":null,"url":null,"abstract":"A game is considered where the communication network of the first player is explicitly modeled. The second player may induce delays in this network, while the first player may counteract such actions. Costs are modeled through expectations over idempotent probability measures. Idempotent algebras are used to obtain an algorithm for solution of the game.","PeriodicalId":193106,"journal":{"name":"SIAM Conf. on Control and its Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Development of an Idempotent Algorithm for a Network-Delay Game\",\"authors\":\"W. McEneaney, Amit P. Pandey\",\"doi\":\"10.1137/1.9781611974072.60\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A game is considered where the communication network of the first player is explicitly modeled. The second player may induce delays in this network, while the first player may counteract such actions. Costs are modeled through expectations over idempotent probability measures. Idempotent algebras are used to obtain an algorithm for solution of the game.\",\"PeriodicalId\":193106,\"journal\":{\"name\":\"SIAM Conf. on Control and its Applications\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIAM Conf. on Control and its Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1137/1.9781611974072.60\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Conf. on Control and its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1137/1.9781611974072.60","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

在一个游戏中，第一个玩家的通信网络被明确地建模。第二个参与者可能在该网络中引起延迟，而第一个参与者可能抵消这种行为。成本是通过对幂等概率度量的期望来建模的。利用幂等代数得到了该对策的一种求解算法。

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

查看原文本刊更多论文

Development of an Idempotent Algorithm for a Network-Delay Game

A game is considered where the communication network of the first player is explicitly modeled. The second player may induce delays in this network, while the first player may counteract such actions. Costs are modeled through expectations over idempotent probability measures. Idempotent algebras are used to obtain an algorithm for solution of the game.

求助全文

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

来源期刊

SIAM Conf. on Control and its Applications

自引率

0.00%

发文量