离散上校布托博弈的最弱链接均衡计算

IF 2.4 Q2 AUTOMATION & CONTROL SYSTEMS

IEEE Control Systems Letters Pub Date : 2025-04-29 DOI:10.1109/LCSYS.2025.3565611

Adrianto Ravi Ibrahim;Yurid E. Nugraha

{"title":"离散上校布托博弈的最弱链接均衡计算","authors":"Adrianto Ravi Ibrahim;Yurid E. Nugraha","doi":"10.1109/LCSYS.2025.3565611","DOIUrl":null,"url":null,"abstract":"A class of Colonel Blotto Games between two agents over multiple locations are discussed. In this letter, we consider the scenario where one of the agents wins whenever she allocates more resources in all locations. We derive a theoretical result showing that mixed Nash equilibria in such games could be computed in polynomial time.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"9 ","pages":"132-137"},"PeriodicalIF":2.4000,"publicationDate":"2025-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Equilibria Computation of the Weakest-Link Discrete Colonel Blotto Games\",\"authors\":\"Adrianto Ravi Ibrahim;Yurid E. Nugraha\",\"doi\":\"10.1109/LCSYS.2025.3565611\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A class of Colonel Blotto Games between two agents over multiple locations are discussed. In this letter, we consider the scenario where one of the agents wins whenever she allocates more resources in all locations. We derive a theoretical result showing that mixed Nash equilibria in such games could be computed in polynomial time.\",\"PeriodicalId\":37235,\"journal\":{\"name\":\"IEEE Control Systems Letters\",\"volume\":\"9 \",\"pages\":\"132-137\"},\"PeriodicalIF\":2.4000,\"publicationDate\":\"2025-04-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Control Systems Letters\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10979916/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Control Systems Letters","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10979916/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}

引用次数: 0

摘要

讨论了一类两个agent在多个地点之间的Colonel Blotto博弈。在这封信中，我们考虑这样一种情况：当其中一个代理在所有位置分配更多资源时，她就会获胜。我们得到了一个理论结果，表明这种博弈中的混合纳什均衡可以在多项式时间内计算出来。

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

查看原文本刊更多论文

Equilibria Computation of the Weakest-Link Discrete Colonel Blotto Games

A class of Colonel Blotto Games between two agents over multiple locations are discussed. In this letter, we consider the scenario where one of the agents wins whenever she allocates more resources in all locations. We derive a theoretical result showing that mixed Nash equilibria in such games could be computed in polynomial time.

求助全文

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

来源期刊

IEEE Control Systems Letters Mathematics-Control and Optimization

CiteScore

4.40

自引率

13.30%

发文量

471