Mukund Sundararajan, Ph.D.
Affiliations: | 2009 | Stanford University, Palo Alto, CA |
Google:
"Mukund Sundararajan"Parents
Sign in to add mentorTimothy A. Roughgarden | grad student | 2009 | Stanford | |
(Trade-offs in cost sharing.) |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Sundararajan M, Talgam-Cohen I. (2016) Prediction and Welfare in Ad Auctions Theory of Computing Systems. 1-19 |
Iyer K, Johari R, Sundararajan M. (2014) Mean field Equilibria of dynamic auctions with learning Management Science. 60: 2949-2970 |
Ghosh A, Roughgarden T, Sundararajan M. (2012) Universally utility-maximizing privacy mechanisms Siam Journal On Computing. 41: 1673-1693 |
Sundararajan M, Yan Q. (2011) Robust mechanisms for risk-averse sellers Games and Economic Behavior |
Gupte M, Sundararajan M. (2010) Universally optimal privacy mechanisms for minimax agents Proceedings of the Acm Sigact-Sigmod-Sigart Symposium On Principles of Database Systems. 135-145 |
Roughgarden T, Sundararajan M. (2009) Quantifying inefficiency in cost-sharing mechanisms Journal of the Acm. 56 |
Mehta A, Roughgarden T, Sundararajan M. (2009) Beyond Moulin mechanisms Games and Economic Behavior. 67: 125-155 |
Dughmi S, Roughgarden T, Sundararajan M. (2009) Revenue submodularity Lecture Notes of the Institute For Computer Sciences, Social-Informatics and Telecommunications Engineering. 14: 89-91 |
Dobzinski S, Sundararajan M. (2008) On characterizations of truthful mechanisms for combinatorial auctions and scheduling Proceedings of the Acm Conference On Electronic Commerce. 38-47 |
Dobzinski S, Mehta A, Roughgarden T, et al. (2008) Is shapley cost sharing optimal? Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4997: 327-336 |