Private Pareto Optimal Exchange

We consider the problem of implementing an individually rational, asymptotically Pareto optimal allocation in a barter-exchange economy where agents are endowed with goods and preferences over the goods of others, but may not use money as a medium of exchange. Because one of the most important instantiations of such economies is kidney exchange -- where the "input" to the problem consists of sensitive patient medical records -- we ask to what extent such exchanges can be carried out while providing formal privacy guarantees to the participants. We show that individually rational allocations cannot achieve any non-trivial approximation to Pareto optimality if carried out under the constraint of differential privacy -- or even the relaxation of joint-differential privacy, under which it is known that asymptotically optimal allocations can be computed in two sided markets [Hsu et al. STOC 2014]. We therefore consider a further relaxation that we call marginal-differential privacy --which promises, informally, that the privacy of every agent i is protected from every other agent j ≠ i so long as j does not collude or share allocation information with other agents. We show that under marginal differential privacy, it is possible to compute an individually rational and asymptotically Pareto optimal allocation in such exchange economies.

[1]  Aaron Roth,et al.  Mechanism design in large games: incentives and privacy , 2012, ITCS.

[2]  Éva Tardos,et al.  Learning and Efficiency in Games with Dynamic Population , 2015, SODA.

[3]  Justin Hsu,et al.  Jointly Private Convex Programming , 2014, SODA.

[4]  Aaron Roth,et al.  Asymptotically truthful equilibrium selection in large congestion games , 2013, EC.

[5]  Jay Sethuraman,et al.  House allocation with indifferences: a generalization and a unified view , 2013, EC '13.

[6]  Guy N. Rothblum,et al.  Boosting and Differential Privacy , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[7]  Tim Roughgarden,et al.  Private matchings and allocations , 2013, SIAM J. Comput..

[8]  Xiaosheng Mu,et al.  Differentially private and incentive compatible recommendation system for the adoption of network goods , 2014, EC.

[9]  Aaron Roth,et al.  Differentially private combinatorial optimization , 2009, SODA '10.

[10]  Paula Jaramillo,et al.  The Difference Indifference Makes in Strategy-Proof Allocation of Objects , 2012 .

[11]  Kunal Talwar,et al.  Mechanism Design via Differential Privacy , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[12]  Cynthia Dwork,et al.  Calibrating Noise to Sensitivity in Private Data Analysis , 2006, TCC.

[13]  Sofya Raskhodnikova,et al.  Smooth sensitivity and sampling in private data analysis , 2007, STOC '07.

[14]  Alvin E. Roth,et al.  Pairwise Kidney Exchange , 2004, J. Econ. Theory.

[15]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[16]  Jorge Alcalde-Unzu,et al.  Exchange of indivisible goods and indifferences: The Top Trading Absorbing Sets mechanisms , 2009, Games Econ. Behav..

[17]  Paula Jaramillo,et al.  The Difference Indifference Makes in Strategy-Proof Allocation of Objects , 2012, J. Econ. Theory.

[18]  Daniel A. Spielman,et al.  Spectral Graph Theory and its Applications , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[19]  L. Shapley,et al.  On cores and indivisibility , 1974 .

[20]  Ilya Mironov,et al.  Differentially private recommender systems: building privacy into the net , 2009, KDD.