The paper investigates the trade‑off between the costs of participating in federated learning (privacy, communication, compute) and the potential gains in model performance, framing this as a game‑theoretic problem of individual rationality versus autarky. It shows that clients can remain below their local‑training baseline for many rounds and that simply capping per‑round contributions harms learning. The authors propose a new mechanism that provides short‑term participation guarantees and personalized model evaluation, demonstrating theoretically and empirically that clients can avoid short‑term losses without significantly harming overall performance, even under moderate heterogeneity.
By Amin Meghrazi, Srinivasan Parthasarathy, Andrew Perrault
arXiv:2507. 09473v2 Announce Type: replace-cross Abstract: We study the dynamic allocation of indivisible resources to strategic agents under long-term constraints, where the planner aims to maximize social welfare, satisfy multiple constraints, and elicit near-truthful reports.
By Yan Dai, Negin Golrezaei, Patrick Jaillet
arXiv:2606. 18384v1 Announce Type: new Abstract: Hierarchical Federated Learning (HFL) enables scalable collaborative model training across distributed devices while preserving data privacy.
By Seyed Salar Ghazi, Kaiwen Zhang, Mehdi feizi, Hans-Arno Jacobsen
arXiv:2609. 20353v1 Announce Type: new Abstract: We study repeated contract design when a principal observes outcomes but not the actions that generate them.
By Rui Ai, David Simchi-Levi, Han Zhong
arXiv:2412.07813v4 Announce Type: replace-cross
Abstract: To alleviate the training burden in federated learning while enhancing convergence speed, Split Federated Learning (SFL) has emerged as a pro...
By Joohyung Lee, Jungchan Cho, Wonjun Lee, Mohamed Seif, H. Vincent Poor
arXiv:2607. 26788v1 Announce Type: cross Abstract: Clustered federated learning benefits from organizing heterogeneous participants into coalitions that train coalition-specific models, but such clustering is sustainable only if participants prefer their assigned coalition and the required transfers are affordable.
By Cengis Hasan
arXiv:2506.03911v2 Announce Type: replace
Abstract: Points-based rewards programs are a prevalent way to incentivize customer loyalty. In theory, the effective design of these programs is shaped by t...
By Chamsi Hssaine, Yichun Hu, Ciara Pike-Burke
arXiv:2607. 09802v1 Announce Type: new Abstract: The escalating demand for Machine Learning (ML) training resources in recent years has resulted in a substantial gap between the high demand and the available supply.
By Balasubramanian Sivan, Renato Paes Leme, Mihai Tiuca, Ian McFarlane, Vasilis Gkatzelis, Nehal Mehta, Soheil Hassas Yeganeh, Vahab Mirrokni, Amin Vahdat
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.
By Kaiqi Jiang, Karim El Husseini, Wenzhe Fan, Xinhua Zhang
arXiv:2609.15389v1 Announce Type: cross
Abstract: As artificial intelligence systems increasingly rely on distributed and collaborative training, the energy footprint of these processes becomes a sha...
By Konstantinos Varsos, Ramin Khalili, Adamantia Stamou, George D. Stamoulis, Vasillios A. Siris
arXiv:2606. 17489v1 Announce Type: cross Abstract: Large Language Models (LLMs) are increasingly deployed in edge-cloud inference systems to handle diverse user tasks with heterogeneous accuracy, latency, and cost profiles.
By Yin Huang, Qingsong Liu, Jie Xu
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.
By Seyed Majid Zahedi, Rupert Freeman