Platforms for Efficient and Incentive-Aware Collaboration
Nika Haghtalab, Mingda Qiao, Kunhe Yang
Abstract
Collaboration is crucial for reaching collective goals. However, its potential for effectiveness is often undermined by the strategic behavior of individual agents -a fact that is captured by a high Price of Stability (PoS) in recent literature [Blum et al., 2021a]. Implicit in the traditional PoS analysis is the assumption that agents have full knowledge of how their tasks relate to one another. We offer a new perspective on bringing about efficient collaboration across strategic agents using information design. Inspired by the increasingly important role collaboration plays in machine learning (such as platforms for collaborative federated learning and data cooperatives), we propose a framework in which the platform possesses more information about how the agents' tasks relate to each other than the agents themselves. Our results characterize how and to what degree such platforms can leverage their information advantage and steer strategic agents towards efficient collaboration.
Concretely, we consider collaboration networks in which each node represents a task type held by one agent, and each task benefits from contributions made in their inclusive neighborhood of tasks. This network structure is known to the agents and the platform. On the other hand, the real location of each agent in the network is known to the platform only -from the perspective of the agents, their location is determined by a uniformly random permutation. We employ the framework of private Bayesian persuasion and design two families of persuasive signaling schemes that the platform can use to guarantee a small total workload when agents follow the signal. The first family aims to achieve the minmax optimal approximation ratio compared to the total workload in the optimal collaboration, which is shown to be Θ( √ n) for unit-weight graphs, Θ(n 2 3 ) for graphs with edge weights lower bounded by Ω(1), and O(n 3 4 ) for general weighted graphs. The second family ensures per-instance strict improvement in the total workload compared to scenarios with full information disclosure.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 898a97b1-2220-400a-b47a-66be12f1396bBuilds on11
- Gradient Driven Rewards to Guarantee Fairness in Collaborative Machine LearningXinyi Xu, Lingjuan Lyu, Xingjun Ma, Chenglin Miao et al.NeurIPS 2021 · 133 citations
- Model-sharing Games: Analyzing Federated Learning Under Voluntary ParticipationKate Donahue, Jon M. KleinbergAAAI 2021 · 96 citations
- Optimality and Stability in Federated Learning: A Game-theoretic ApproachKate Donahue, Jon M. KleinbergNeurIPS 2021 · 74 citations
- One for One, or All for All: Equilibria and Optimality of Collaboration in Federated LearningAvrim Blum, Nika Haghtalab, Richard Lanas Phillips, Han ShaoICML 2021 · 62 citations
- On-Demand Sampling: Learning Optimally from Multiple DistributionsNika Haghtalab, Michael I. Jordan, Eric ZhaoNeurIPS 2022 · 57 citations
Related papers
- PrismFed: Joint Optimization via Dynamic Bayesian Persuasion for Multi-Task Federated Learning under Incomplete InformationJianfeng Lu, Shicheng Xie, Yun Xin, Shuqin Cao et al.KDD 2026
- Signaling in Bayesian Network Congestion Games: the Subtle Power of SymmetryMatteo Castiglioni, Andrea Celli, Alberto Marchesi, Nicola GattiAAAI 2021 · 44 citations
- Online Bayesian PersuasionMatteo Castiglioni, Andrea Celli, Alberto Marchesi, Nicola GattiNeurIPS 2020 · 26 citations
- Private Bayesian Persuasion with Sequential GamesAndrea Celli, Stefano Coniglio, Nicola GattiAAAI 2020 · 29 citations
- The Price of Competitive Information DisclosureSiddhartha Banerjee, Kamesh Munagala, Yiheng Shen, Kangning WangSTOC 2026 · 1 citation
