Aranyak Mehta, Ph.D. - Publications
Affiliations: | 2005 | Georgia Institute of Technology, Atlanta, GA |
Area:
Computer ScienceYear | Citation | Score | |||
---|---|---|---|---|---|
2011 | Krauthgamer R, Mehta A, Rudra A. Pricing commodities Theoretical Computer Science. 412: 602-613. DOI: 10.1016/J.Tcs.2009.10.002 | 0.321 | |||
2009 | Daskalakis C, Mehta A, Papadimitriou C. A note on approximate Nash equilibria Theoretical Computer Science. 410: 1581-1588. DOI: 10.1016/J.Tcs.2008.12.031 | 0.359 | |||
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.317 | |||
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.32 | |||
2007 | Mehta A, Saberi A, Vazirani U, Vazirani V. AdWords and generalized online matching Journal of the Acm. 54. DOI: 10.1145/1284320.1284321 | 0.568 | |||
2006 | Chakrabarty D, Mehta A, Vazirani VV. Design is as easy as optimization Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4051: 477-488. DOI: 10.1137/080735898 | 0.587 | |||
2006 | Mehta A, Shenker S, Vazirani VV. Posted price profit maximization for multicast by approximating fixed points Journal of Algorithms. 58: 150-164. DOI: 10.1016/J.Jalgor.2004.08.002 | 0.545 | |||
Show low-probability matches. |