Incentivizing Collaboration in Heterogeneous Teams via Common-Pool Resource Games
Not on the map. Why?
Abstract (arXiv)
We consider a team of heterogeneous agents that is collectively responsible for servicing, and subsequently reviewing, a stream of homogeneous tasks. Each agent has an associated mean service time and a mean review time for servicing and reviewing the tasks, respectively. Agents receive a reward based on their service and review admission rates. The team objective is to collaboratively maximize the number of "serviced and reviewed" tasks. We formulate a Common-Pool Resource (CPR) game and design utility functions to incentivize collaboration among heterogeneous agents in a decentralized manner. We show the existence of a unique Pure Nash Equilibrium (PNE), and establish convergence of best response dynamics to this unique PNE. Finally, we establish an analytic upper bound on three measures of inefficiency of the PNE, namely the price of anarchy, the ratio of the total review admission rate, and the ratio of latency, along with an empirical study.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). First posted on arXiv 11 Aug 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.
- 2025Generalized Mission Planning for Heterogeneous Multi-Robot Teams via LLM-constructed Hierarchical Treescited by 9
- 2026KGLAMP: Knowledge Graph-guided Language model for Adaptive Multi-robot Planning and Replanningcited by 2
- 2026Scale-Plan: Scalable Language-Enabled Task Planning for Heterogeneous Multi-Robot Teamscited by 1
- 2026Scale-Plan: Scalable Language-Enabled Task Planning for Heterogeneous Multi-Robot Teams9 Mar 2026
- 2026KGLAMP: Knowledge Graph-guided Language model for Adaptive Multi-robot Planning and Replanning4 Feb 2026
- 2025Generalized Mission Planning for Heterogeneous Multi-Robot Teams via LLM-constructed Hierarchical Trees27 Jan 2025