Fetching the paper…
Reading the bibliography…
We consider a private variant of the classical allocation problem: given k goods and n agents with individual, private valuation functions over bundles of goods, how can we partition the goods amongst the agents to maximize social welfare? An important special case is when each agent desires at most one good, and specifies her (private) value for each good: in this case, the problem is exactly the maximum-weight matching problem in a bipartite graph.
Job matching, coalition formation, and gross substitutes
Alexander Kelso and Vincent Crawford · 1982
Earlier work this paper cites.
Walrasian equilibrium with gross substitutes
Faruk Gul and Ennio Stacchetti · 1999
Earlier work this paper cites.
Revealing information while preserving privacy
Irit Dinur and Kobbi Nissim · 2003
Earlier work this paper cites.
Calibrating noise to sensitivity in private data analysis
Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith · 2006
Earlier work this paper cites.
Smooth sensitivity and sampling in private data analysis
Kobbi Nissim, Sofya Raskhodnikova, and Adam Smith · 2007
Earlier work this paper cites.
Differentially private recommender systems: building privacy into the net
Frank McSherry and Ilya Mironov · 2009
Earlier work this paper cites.
Differentially private combinatorial optimization
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaron Roth, and Kunal Talwar · 2010
Cited alongside, same era.
A multiplicative weights mechanism for privacy-preserving data analysis
Moritz Hardt and Guy N. Rothblum · 2010
Cited alongside, same era.
Private and continual release of statistics
T.-H. Hubert Chan, Elaine Shi, and Dawn Song · 2011
Cited alongside, same era.
The privacy of the analyst and the power of the state
Cynthia Dwork, Moni Naor, and Salil Vadhan · 2012
Cited alongside, same era.
A learning theory approach to noninteractive database privacy
Avrim Blum, Katrina Ligett, and Aaron Roth · 2013
Cited alongside, same era.
Mallesh Pai and Aaron Roth · 2013
Closest in time.
The algorithmic foundations of differential privacy
Cynthia Dwork and Aaron Roth · 2014
Closest in time.
Private matchings and allocations
Justin Hsu, Zhiyi Huang, Aaron Roth, Tim Roughgarden, and Zhiwei Steven Wu · 2014
Closest in time.
Mechanism design in large games: Incentives and privacy
Michael Kearns, Mallesh Pai, Aaron Roth, and Jonathan Ullman · 2014
Closest in time.
Asymptotically truthful equilibrium selection in large congestion games
Ryan M Rogers and Aaron Roth · 2014
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Justin Hsu, Aaron Roth, and Jonathan Ullman · 2013
Cited alongside, same era.
Differential privacy under continual observation
Cynthia Dwork, Moni Naor, Toniann Pitassi, and Guy N. Rothblum
Cited in the paper.
Boosting and differential privacy
Cynthia Dwork, Guy N. Rothblum, and Salil Vadhan
Cited in the paper.