Temporal Fair Division in Multi-Agent Systems: From Precise Alternation Metrics to Scalable Coordination Proxies

תקציר מקורי באנגליתarXiv:2605.14879v2 Announce Type: replace-cross Abstract: 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 both the regularity of waiting times between suc