Credit Fairness: Online Fairness In Shared Resource Pools
arXiv:2601. 17944v2 Announce Type: replace-cross Abstract: We study repeated allocation of shared resources among agents with time-varying demands and capped linear utilities.
arXiv:2607. 17311v1 Announce Type: cross Abstract: The problem of fair multi-agent coordination in decentralized settings is one of the most pressing challenges for building efficient collaborative systems.
arXiv:2601. 17944v2 Announce Type: replace-cross Abstract: We study repeated allocation of shared resources among agents with time-varying demands and capped linear utilities.
arXiv:2608. 07532v1 Announce Type: new Abstract: Modern agentic AI systems combine multiple large language model agents with heterogeneous skills, yet most architectures either fix communication in advance or allow full broadcast.
arXiv:2608.22152v1 Announce Type: new Abstract: Multi-agent systems built from large language models are deployed widely, yet how much performance is lost when two LLMs must coordinate rather than ac...
The paper introduces Hierarchical Reinforcement and Collective Learning (HRCL), a framework that combines multi‑agent reinforcement learning (MARL) with decentralized coordination. HRCL uses MARL at a high level to generate strategic guidance that limits the decision space for low‑level agents, enabling efficient short‑term coordination while considering long‑term effects. Experiments on synthetic, energy‑management, and drone‑swarm scenarios demonstrate faster convergence and significant reductions in system‑wide and individual costs compared to standalone MARL.
arXiv:2606. 10472v1 Announce Type: cross Abstract: Dynamic multi-resource allocation is a central problem in shared computing environments, where users' demands arrive sequentially and resources must be distributed fairly without knowledge of future demands.
The paper introduces DMFL-SQ, a decentralized multi-task learning algorithm that integrates graph-based personalization, agnostic fairness, and compressed event-triggered communication. It provides convergence guarantees for non-convex objectives, achieving an ≠O(T^{-1/2}) stationarity rate despite sparse, quantized, and event-triggered communication, and offers PAC-Bayes generalization bounds for the fairness objective. Experiments on CIFAR-10 and the MUSMET EEG dataset show that DMFL-SQ reduces communication while preserving predictive performance and improving fairness across clients.
arXiv:2607. 26485v1 Announce Type: cross Abstract: Resource allocation across multiple agent groups arises in many applications including e-commerce recommendation systems, housing assignment, and course allocation, and is commonly formulated as an optimization problem with diversity constraints to ensure group fairness.
arXiv:2606. 06391v1 Announce Type: cross Abstract: Sharing the financial impact of rare adverse events across a group can soften extreme individual burdens, but any participant made worse off by the arrangement has reason to leave.
arXiv:2604. 07821v2 Announce Type: replace-cross Abstract: Large language model (LLM) agents increasingly coordinate in multi-agent systems, yet we lack an understanding of where and why cooperation fails.
arXiv:2605.25200v3 Announce Type: replace Abstract: Travel planning in the real world is overwhelmingly a \textit{group} activity, yet existing LLM travel-planning benchmarks reduce it to a single us...
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.
arXiv:2605. 09823v3 Announce Type: replace-cross Abstract: Personal AI assistants are beginning to act as delegates with access to calendars, inboxes, and user preferences.