跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2412.01968 · v2

On the Theoretical Foundations of Data Exchange Economies

论数据交换经济的理论基础

首次提交 2024-12-03 04:55
版本更新 2026-11-11 01:26
雷达观测 2026-11-11 13:07
arXiv ↗PDF ↗

摘要

Organizations increasingly seek to share and access datasets to improve their ML models and derive insights. Despite the immense demand for quality data, data exchange and collaboration have not reached their full potential, as cited by the European Commission. One of the key reasons is the lack of reciprocity, where some participants perceive their contribution to others to be of higher value than what they receive in return. We propose a general framework for data exchange without payments, focusing on two main properties: (i) reciprocal fairness, which ensures that each agent receives utility proportional to their contribution to the total welfare -- contributions are quantifiable using well-established credit-sharing functions such as the Shapley share and proportional share, and (ii) core-stability, which guarantees that no coalition of agents can identify an exchange among themselves which they all unanimously prefer to the current exchange. Surprisingly, we show that fair and stable exchanges exist for all monotone continuous utility functions. Building on this, we investigate the computational complexity of finding approximate fair and stable exchanges. We present a local search algorithm for instances with monotone submodular utility functions and cross-monotone credit-sharing functions, e.g., Shapley share. We prove that this problem belongs to CLS (== PPAD ∩\cap PLS) under mild assumptions. Our framework opens up several intriguing theoretical avenues for future research on data economics.

作者备注:40 pages. Appeared at EC 2025

AI 论文解读

基于摘要 · 非全文审阅

提出无支付数据交换框架,要求互惠公平与核心稳定,并证明在单调连续效用下公平稳定交换存在,进而研究近似解的计算复杂度。

正在读取账号与研究记录…

版本差异

本站首次收录为 v2,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v2 · 2026-11-11 01:26 · 最新观测版本

On the Theoretical Foundations of Data Exchange Economies

Organizations increasingly seek to share and access datasets to improve their ML models and derive insights. Despite the immense demand for quality data, data exchange and collaboration have not reached their full potential, as cited by the European Commission. One of the key reasons is the lack of reciprocity, where some participants perceive their contribution to others to be of higher value than what they receive in return. We propose a general framework for data exchange without payments, focusing on two main properties: (i) reciprocal fairness, which ensures that each agent receives utility proportional to their contribution to the total welfare -- contributions are quantifiable using well-established credit-sharing functions such as the Shapley share and proportional share, and (ii) core-stability, which guarantees that no coalition of agents can identify an exchange among themselves which they all unanimously prefer to the current exchange. Surprisingly, we show that fair and stable exchanges exist for all monotone continuous utility functions. Building on this, we investigate the computational complexity of finding approximate fair and stable exchanges. We present a local search algorithm for instances with monotone submodular utility functions and cross-monotone credit-sharing functions, e.g., Shapley share. We prove that this problem belongs to CLS (== PPAD ∩\cap PLS) under mild assumptions. Our framework opens up several intriguing theoretical avenues for future research on data economics.

查看此版本解读 →查看此版本原文 ↗