Inefficient Alliance Formation in Coalitional Blotto Games

Vade Shah, Keith Paarporn, Jason R. Marden
{"title":"Inefficient Alliance Formation in Coalitional Blotto Games","authors":"Vade Shah, Keith Paarporn, Jason R. Marden","doi":"arxiv-2409.06899","DOIUrl":null,"url":null,"abstract":"In adversarial resource allocation settings, forming alliances can enhance\nperformance, but the benefits may diminish if alliance formation becomes\ncostly. In this work, we explore this issue using the framework of the\ncoalitional Blotto game, in which two players compete separately against a\ncommon adversary across valued contests. Each player aims to win contests by\nallocating more of their limited budget than their opponent. Previous work on\nalliance formation in coalitional Blotto games has shown that if one player\ntransfers a portion of their budget to the other, then both players can perform\nbetter; however, it is also known that it is never in either players' interest\nto simply concede a portion of their budget. In this work, we study the setting\nin which transfers are costly, meaning that if one player donates a portion of\ntheir budget, the recipient only receives a fraction of the transferred amount.\nWe show that mutually beneficial costly transfers exist, and we provide\nnecessary and sufficient conditions for the existence of such a costly\ntransfer. Then, we consider the setting in which players can transfer budgets\nand contests at a cost, and we show that this alliance strategy is mutually\nbeneficial in almost all game instances.","PeriodicalId":501316,"journal":{"name":"arXiv - CS - Computer Science and Game Theory","volume":"5 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Computer Science and Game Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.06899","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In adversarial resource allocation settings, forming alliances can enhance performance, but the benefits may diminish if alliance formation becomes costly. In this work, we explore this issue using the framework of the coalitional Blotto game, in which two players compete separately against a common adversary across valued contests. Each player aims to win contests by allocating more of their limited budget than their opponent. Previous work on alliance formation in coalitional Blotto games has shown that if one player transfers a portion of their budget to the other, then both players can perform better; however, it is also known that it is never in either players' interest to simply concede a portion of their budget. In this work, we study the setting in which transfers are costly, meaning that if one player donates a portion of their budget, the recipient only receives a fraction of the transferred amount. We show that mutually beneficial costly transfers exist, and we provide necessary and sufficient conditions for the existence of such a costly transfer. Then, we consider the setting in which players can transfer budgets and contests at a cost, and we show that this alliance strategy is mutually beneficial in almost all game instances.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
联盟博弈中的无效率联盟形成
在对抗性资源分配环境中,结成联盟可以提高绩效,但如果结成联盟的成本变得很高,收益可能会减少。在这项工作中,我们利用传统布洛托博弈的框架来探讨这个问题,在这个博弈中,两个博弈者在有价值的竞赛中分别与共同的对手竞争。每个玩家的目标都是通过分配比对手更多的有限预算来赢得比赛。以前关于联盟博弈中联盟形成的研究表明,如果一方将其预算的一部分转移给另一方,那么双方都能取得更好的成绩;但是,众所周知,简单地让出一部分预算永远不符合双方的利益。在这项研究中,我们研究了转让是有代价的,即如果一方捐出一部分预算,受让方只能得到转让金额的一小部分。然后,我们考虑了棋手可以有偿转让预算和比赛的情况,并证明这种联盟策略在几乎所有博弈实例中都是互利的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
MALADY: Multiclass Active Learning with Auction Dynamics on Graphs Mechanism Design for Extending the Accessibility of Facilities Common revenue allocation in DMUs with two stages based on DEA cross-efficiency and cooperative game The common revenue allocation based on modified Shapley value and DEA cross-efficiency On Robustness to $k$-wise Independence of Optimal Bayesian Mechanisms
×
引用
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