Temporal Fair Division in Multi-Agent Systems: From Precise Alternation Metrics to Scalable Coordination Proxies
Many intelligent computing and autonomous systems rely on multiple independent, often learning, agents repeatedly sharing a limited resource. Examples include autonomous robots accessing a shared workstation, wireless devices competing for communication opportunities, and distributed AI agents coordinating access to shared computational resources. While conventional fairness measures assess whether resources are shared equally overall, they cannot distinguish orderly turn-taking from irregular access patterns that produce long and unpredictable waiting times despite similar cumulative outcomes. We introduce Rotational Periodicity (RP), a computationally efficient metric that evaluates bot...
| Authors | Nikolaos Al. Papadopoulos, Ismael Tito Freire, Marti Sanchez-Fibla et al. |
|---|---|
| Primary category | cs.MA |
| Published | 14 May 2026 |
| Last updated at source | 21 July 2026 |
Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.