“Universally optimal privacy mechanisms for minimax agents”, Mangesh Gupte, Mukund Sundararajan, Proc. ACM SIGMOD, 2010, pp. 135-146.
[abstract] [doi.acm.org] [search]
“Axiomatic Attribution for Multilinear Functions”, Yi Sun, Mukund Sundararajan, ACM Conference on Electronic Commerce, 2011, pp. 177-178.
[arxiv.org] [search]
“A Learning-Based Approach to Reactive Security”, Adam Barth, Benjamin I. P. Rubinstein, Mukund Sundararajan, John C. Mitchell, Dawn Song, Peter L. Bartlett, Financial Cryptography, 2010, pp. 192-206.
[dx.doi.org] [search]
“Robust mechanisms for risk-averse sellers”, Mukund Sundararajan, Qiqi Yan, ACM Conference on Electronic Commerce, 2010, pp. 139-148.
[doi.acm.org] [search]
“Universally optimal privacy mechanisms for minimax agents”, Mangesh Gupte, Mukund Sundararajan, PODS, 2010, pp. 135-146.
[doi.acm.org] [search]
“A Learning-Based Approach to Reactive Security”, Adam Barth, Benjamin I. P. Rubinstein, Mukund Sundararajan, John C. Mitchell, Dawn Xiaodong Song, Peter L. Bartlett, Financial Cryptography and Data Security, 2009, pp. 192-206.
[arxiv.org] [search]
“An Automated Approach for Proving PCL Invariants”, John C. Mitchell, Arnab Roy, Mukund Sundararajan, ENTCS, vol. 234 (2009), pp. 93-113.
[dx.doi.org] [search]
“New enhancements to the SOCKS communication network security protocol: Schemes and performance evaluation”, Mohammad S. Obaidat, Mukund Sundararajan, Journal of Systems and Software, vol. 82 (2009), pp. 1941-1949.
[dx.doi.org] [search]
“Quantifying inefficiency in cost-sharing mechanisms”, Tim Roughgarden, Mukund Sundararajan, Journal of the ACM, vol. 56 (2009).
[doi.acm.org] [search]
“Revenue Submodularity”, Shaddin Dughmi, Tim Roughgarden, Mukund Sundararajan, AMMA, 2009, pp. 89-91.
[dx.doi.org] [search]
“Revenue submodularity”, Shaddin Dughmi, Tim Roughgarden, Mukund Sundararajan, ACM Conference on Electronic Commerce, 2009, pp. 243-252.
[doi.acm.org] [search]
“Universally utility-maximizing privacy mechanisms”, Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan, STOC, 2009, pp. 351-360.
[doi.acm.org] [search]
“Is Shapley Cost Sharing Optimal?”, Shahar Dobzinski, Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan, SAGT, 2008, pp. 327-336.
[dx.doi.org] [search]
“On characterizations of truthful mechanisms for combinatorial auctions and scheduling”, Shahar Dobzinski, Mukund Sundararajan, ACM Conference on Electronic Commerce, 2008, pp. 38-47.
[doi.acm.org] [search]
“Optimal marketing strategies over social networks”, Jason D. Hartline, Vahab S. Mirrokni, Mukund Sundararajan, WWW, 2008, pp. 189-198.
[doi.acm.org] [search]
“Beyond moulin mechanisms”, Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan, ACM Conference on Electronic Commerce, 2007, pp. 1-10.
[doi.acm.org] [search]
“Computing Optimal Bundles for Sponsored Search”, Arpita Ghosh, Hamid Nazerzadeh, Mukund Sundararajan, WINE, 2007, pp. 576-583.
[dx.doi.org] [search]
“Optimal Efficiency Guarantees for Network Design Mechanisms”, Tim Roughgarden, Mukund Sundararajan, IPCO, 2007, pp. 469-483.
[dx.doi.org] [search]
“Stochastic Mechanism Design”, Samuel Ieong, Anthony Man-Cho So, Mukund Sundararajan, WINE, 2007, pp. 269-280.
[dx.doi.org] [search]
“New trade-offs in cost-sharing mechanisms”, Tim Roughgarden, Mukund Sundararajan, STOC, 2006, pp. 79-88.
[doi.acm.org] [search]
“Optimal Cost-Sharing Mechanisms for Steiner Forest Problems”, Shuchi Chawla, Tim Roughgarden, Mukund Sundararajan, WINE, 2006, pp. 112-123.
[dx.doi.org] [search]
“Chaining Algorithms for Alignment of Draft Sequence”, Mukund Sundararajan, Michael Brudno, Kerrin Small, Arend Sidow, Serafim Batzoglou, WABI, 2004, pp. 326-337.
[springerlink.metapress.com] [search]