Data Sharing Markets

by   Mohammad Rasouli, et al.

With the growing use of distributed machine learning techniques, there is a growing need for data markets that allows agents to share data with each other. Nevertheless data has unique features that separates it from other commodities including replicability, cost of sharing, and ability to distort. We study a setup where each agent can be both buyer and seller of data. For this setup, we consider two cases: bilateral data exchange (trading data with data) and unilateral data exchange (trading data with money). We model bilateral sharing as a network formation game and show the existence of strongly stable outcome under the top agents property by allowing limited complementarity. We propose ordered match algorithm which can find the stable outcome in O(N^2) (N is the number of agents). For the unilateral sharing, under the assumption of additive cost structure, we construct competitive prices that can implement any social welfare maximizing outcome. Finally for this setup when agents have private information, we propose mixed-VCG mechanism which uses zero cost data distortion of data sharing with its isolated impact to achieve budget balance while truthfully implementing socially optimal outcomes to the exact level of budget imbalance of standard VCG mechanisms. Mixed-VCG uses data distortions as data money for this purpose. We further relax zero cost data distortion assumption by proposing distorted-mixed-VCG. We also extend our model and results to data sharing via incremental inquiries and differential privacy costs.


page 1

page 2

page 3

page 4


Cost Sharing in Two-Sided Markets

Motivated by the emergence of popular service-based two-sided markets wh...

Budget Feasible Mechanisms for Procurement Auctions with Divisible Agents

We consider budget feasible mechanisms for procurement auctions with add...

Complexity of Stability in Trading Networks

Efficient computability is an important property of solution concepts in...

Efficient Network Sharing with Asymmetric Constraint Information

Network sharing has become a key feature of various enablers of the next...

Cost Sharing under Private Valuation and Connection Control

We consider a cost sharing problem on a weighted undirected graph, where...

Decentralized Ride-Sharing and Vehicle-Pooling Based on Fair Cost-Sharing Mechanisms

Ride-sharing or vehicle-pooling allows commuters to team up spontaneousl...

Private Blotto: Viewpoint Competition with Polarized Agents

Colonel Blotto games are one of the oldest settings in game theory, orig...

Please sign up or login with your details

Forgot password? Click here to reset