ACM Symposium on Discrete Algorithms, SODA 2015


Article Details
Title: Approximately Stable, School Optimal, and Student-Truthful Many-to-One Matchings (via Differential Privacy)
Article URLs:
Alternative Article URLs:
Authors: Sampath Kannan
  • University of Pennsylvania, Department of Computer and Information Science
Jamie Morgenstern
  • Carnegie Mellon University, Computer Science Department
Aaron Roth
  • University of Pennsylvania, Department of Computer and Information Science
Zhiwei Steven Wu
  • University of Pennsylvania, Department of Computer and Information Science
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1317788, 1116892, 1101215, 1101389, 1065060
DBLP Key: conf/soda/KannanMRW15
Author Comments:

Discuss this paper and its artifacts below