Incentive Design in Competitive Resource Allocation: Exploiting Valuation Asymmetry in Tullock Contests

IF 1.9 Q2 AUTOMATION & CONTROL SYSTEMS
IEEE Control Systems Letters Pub Date : 2026-01-01 Epub Date: 2026-07-09 DOI:10.1109/LCSYS.2026.3710806
Gilberto Díaz-García;Keith Paarporn;Jason R. Marden
{"title":"Incentive Design in Competitive Resource Allocation: Exploiting Valuation Asymmetry in Tullock Contests","authors":"Gilberto Díaz-García;Keith Paarporn;Jason R. Marden","doi":"10.1109/LCSYS.2026.3710806","DOIUrl":null,"url":null,"abstract":"In competitive resource allocation, a central coordinator may seek to gain an advantage not by directly controlling subordinate agents, but by strategically manipulating the information they receive. We study this problem within the framework of multi-player Tullock contests, where the coordinator influences subordinate players by designing their reported valuations of the contested prize, a mechanism that preserves the Tullock structure of the subordinates’ objectives and thereby enables tractable equilibrium analysis. We first characterize the Nash equilibrium of the general multi-player Tullock contest, establishing how valuations and per-unit costs jointly determine equilibrium bids and payoffs. We then derive the optimal reported valuations for a coordinator managing two subordinates against a single opponent, and show that the structure of the optimal solution extends to contests with an arbitrary number of subordinates, reducing the coordinator’s optimization to a two-variable problem regardless of system size.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"10 ","pages":"1747-1752"},"PeriodicalIF":1.9000,"publicationDate":"2026-01-01","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/11602070/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/7/9 0:00:00","PubModel":"Epub","JCR":"Q2","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

In competitive resource allocation, a central coordinator may seek to gain an advantage not by directly controlling subordinate agents, but by strategically manipulating the information they receive. We study this problem within the framework of multi-player Tullock contests, where the coordinator influences subordinate players by designing their reported valuations of the contested prize, a mechanism that preserves the Tullock structure of the subordinates’ objectives and thereby enables tractable equilibrium analysis. We first characterize the Nash equilibrium of the general multi-player Tullock contest, establishing how valuations and per-unit costs jointly determine equilibrium bids and payoffs. We then derive the optimal reported valuations for a coordinator managing two subordinates against a single opponent, and show that the structure of the optimal solution extends to contests with an arbitrary number of subordinates, reducing the coordinator’s optimization to a two-variable problem regardless of system size.
竞争资源配置中的激励设计:利用图洛克竞争中的价值不对称
在竞争性资源分配中,中央协调者可能不是通过直接控制下属代理,而是通过战略性地操纵他们收到的信息来寻求优势。我们在多参与者图洛克竞赛的框架内研究这个问题,其中协调者通过设计下级参与者对竞争奖品的报告估值来影响下级参与者,这种机制保留了下级目标的图洛克结构,从而实现了易于处理的均衡分析。我们首先描述了一般多人塔洛克竞赛的纳什均衡,建立了估价和单位成本如何共同决定均衡出价和收益。然后,我们导出了管理两个下属对抗单个对手的协调器的最优报告估值,并表明最优解的结构扩展到具有任意数量的下属的竞争,将协调器的优化简化为与系统大小无关的双变量问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Control Systems Letters
IEEE Control Systems Letters Mathematics-Control and Optimization
CiteScore
4.40
自引率
13.30%
发文量
471
×
引用
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学术官方微信
小红书