11 citations · 27 across the 14 of their papers we have counts for
3 papers · 1 filter
Private Pareto Optimal Exchange
Sampath Kannan, Jamie Morgenstern, Ryan Rogers +1
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 have…
Approximately Stable, School Optimal, and Student-Truthful Many-to-One Matchings (via Differential Privacy)
Sampath Kannan, Jamie Morgenstern, Aaron Roth +1
We present a mechanism for computing asymptotically stable school optimal matchings, while guaranteeing that it is an asymptotic dominant strategy for every student to report their…
Near-Linear Query Complexity for Graph Inference
Sampath Kannan, Claire Mathieu, Hang Zhou
How efficiently can we find an unknown graph using distance or shortest path queries between its vertices? Let be an unweighted, connected graph of bounded degree. The…