Year |
Citation |
Score |
2016 |
Sundararajan M, Talgam-Cohen I. Prediction and Welfare in Ad Auctions Theory of Computing Systems. 1-19. DOI: 10.1007/S00224-016-9679-Z |
0.391 |
|
2014 |
Iyer K, Johari R, Sundararajan M. Mean field Equilibria of dynamic auctions with learning Management Science. 60: 2949-2970. DOI: 10.1287/Mnsc.2014.2018 |
0.363 |
|
2012 |
Ghosh A, Roughgarden T, Sundararajan M. Universally utility-maximizing privacy mechanisms Siam Journal On Computing. 41: 1673-1693. DOI: 10.1137/09076828X |
0.596 |
|
2011 |
Sundararajan M, Yan Q. Robust mechanisms for risk-averse sellers Games and Economic Behavior. DOI: 10.1016/J.Geb.2015.01.005 |
0.414 |
|
2010 |
Gupte M, Sundararajan M. Universally optimal privacy mechanisms for minimax agents Proceedings of the Acm Sigact-Sigmod-Sigart Symposium On Principles of Database Systems. 135-145. DOI: 10.1145/1807085.1807105 |
0.315 |
|
2009 |
Roughgarden T, Sundararajan M. Quantifying inefficiency in cost-sharing mechanisms Journal of the Acm. 56. DOI: 10.1145/1538902.1538907 |
0.673 |
|
2009 |
Mehta A, Roughgarden T, Sundararajan M. Beyond Moulin mechanisms Games and Economic Behavior. 67: 125-155. DOI: 10.1016/J.Geb.2008.06.005 |
0.687 |
|
2009 |
Dughmi S, Roughgarden T, Sundararajan M. Revenue submodularity Lecture Notes of the Institute For Computer Sciences, Social-Informatics and Telecommunications Engineering. 14: 89-91. DOI: 10.1007/978-3-642-03821-1_13 |
0.54 |
|
2008 |
Dobzinski S, Sundararajan M. On characterizations of truthful mechanisms for combinatorial auctions and scheduling Proceedings of the Acm Conference On Electronic Commerce. 38-47. DOI: 10.1145/1386790.1386798 |
0.307 |
|
2008 |
Dobzinski S, Mehta A, Roughgarden T, Sundararajan M. 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. DOI: 10.1016/J.Geb.2017.03.008 |
0.686 |
|
2007 |
Ieong S, Sundararajan M, So AM. Mechanism design for stochastic optimization problems Acm Sigecom Exchanges. 7: 52-54. DOI: 10.1145/1345037.1345050 |
0.685 |
|
2007 |
Ieong S, So AMC, Sundararajan M. Stochastic mechanism design Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4858: 269-280. |
0.685 |
|
2007 |
Ghosh A, Nazerzadeh H, Sundararajan M. Computing optimal bundles for sponsored search Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4858: 576-583. |
0.372 |
|
2007 |
Roughgarden T, Sundararajan M. Optimal efficiency guarantees for network design mechanisms Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4513: 469-483. |
0.59 |
|
2006 |
Chawla S, Roughgarden T, Sundararajan M. Optimal cost-sharing mechanisms for steiner forest problems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4286: 112-123. DOI: 10.1007/11944874_11 |
0.646 |
|
2006 |
Roughgarden T, Sundararajan M. New trade-offs in cost-sharing mechanisms Proceedings of the Annual Acm Symposium On Theory of Computing. 2006: 79-88. |
0.632 |
|
Show low-probability matches. |