Efficiency of (Revenue-)Optimal Mechanisms, Gagan Aggarwal, Gagan Goel, Aranyak Mehta, Proceedings of the 10th ACM Conference on Electronic Commerce, 2009.
Online Stochastic Matching: Beating 1-1/e, Jon Feldman, Aranyak Mehta, Vahab Mirrokni, S. Muthukrishnan, Symposium on the Foundations of Computer Science (FOCS), 2009 (to appear).
Online budgeted matching in random input models with applications to Adwords, Gagan Goel, Aranyak Mehta, Proc. 19th ACM-SIAM Symposium on Discrete Algorithms, 2008, pp. 982-991.
AdWords and Generalized Online Matching, Aranyak Mehta, Amin Saberi, Umesh Vazirani, Vijay Vazirani, Journal of the ACM, vol. 54, no. 5 (2007).
Adwords Auctions with Decreasing Valuation Bids, Gagan Goel, Aranyak Mehta, Internet and Network Economics (WINE), 2007, pp. 335-340.
A note on approximate Nash equilibria, C. Daskalakis, A. Mehta, C. Papadimitriou, Theoretical Computer Science (2008).
Beyond moulin mechanisms, A. Mehta, T. Roughgarden, M. Sundararajan, Games and Economic Behavior (2008).
Greedy list intersection, R. Krauthgamer, A. Mehta, V. Raman, A. Rudra, IEEE 24th International Conference on Data Engineering, 2008. ICDE 2008, pp. 1033-1042.
Inapproximability results for combinatorial auctions with submodular utility functions, S. Khot, R.J. Lipton, E. Markakis, A. Mehta, Algorithmica, vol. 52 (2008), pp. 3-18.
Is Shapley Cost Sharing Optimal?, S. Dobzinski, A. Mehta, T. Roughgarden, M. Sundararajan, Lecture Notes in Computer Science (SAGT), vol. 4997 (2008), pp. 327.
Pricing commodities, or how to sell when buyers have restricted valuations, R. Krauthgamer, A. Mehta, A. Rudra, Lecture Notes in Computer Science (WAOA), vol. 4927 (2008), pp. 1.
An auction-based market equilibrium algorithm for a production model, S. Kapoor, A. Mehta, V. Vazirani, Theoretical Computer Science, vol. 378 (2007), pp. 153-164.
Progress in approximate Nash equilibria, C. Daskalakis, A. Mehta, C. Papadimitriou, Proceedings of the 8th ACM conference on Electronic commerce, 2007, pp. 355-358.
Some results on approximating the minimax solution in approval voting, R. LeGrand, E. Markakis, A. Mehta, Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems, 2007.
Design is as easy as optimization, D. Chakrabarty, A. Mehta, V.V. Vazirani, Lecture Notes In Computer Science (ICALP), vol. 4051 (2006), pp. 477.
On earthmover distance, metric labeling, and 0-extension, H. Karloff, S. Khot, A. Mehta, Y. Rabani, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, 2006, pp. 547-556.
Posted price profit maximization for multicast by approximating fixed points, A. Mehta, S. Shenker, V.V. Vazirani, Journal of Algorithms (conference version in Electronic Commerce), vol. 58 (2006), pp. 150-164.
A Simple Characterization for Truth-Revealing Single-Item Auctions, Kamal Jain, Aranyak Mehta, Kunal Talwar, Vijay V. Vazirani, WINE, 2005, pp. 122-128.
Fairness and optimality in congestion games, D. Chakrabarty, A. Mehta, V. Nagarajan, Proceedings of the 6th ACM Conference on Electronic Commerce, 2005, pp. 52-57.
Learning symmetric k-juntas in time n\^ o (k), M.N. Kolountzakis, E. Markakis, A. Mehta, Arxiv preprint math.CO/0504246 (2005).
On the fourier spectrum of symmetric boolean functions with applications to learning symmetric juntas, RJ Lipton, E. Markakis, A. Mehta, NK Vishnoi, Computational Complexity, 2005. Proceedings. Twentieth Annual IEEE Conference on, pp. 112-119.
Randomized truthful auctions of digital goods are randomizations over truthful auctions, A. Mehta, V.V. Vazirani, Proceedings of the 5th ACM conference on Electronic commerce, 2004, pp. 120-124.
Playing large games using simple strategies, R.J. Lipton, E. Markakis, A. Mehta, Proceedings of the 4th ACM conference on Electronic commerce, 2003, pp. 36-41.
Randomized time-space tradeoffs for directed graph connectivity, P. Gopalan, R.J. Lipton, A. Mehta, Lecture notes in computer science (FSTTCS) (2003), pp. 208-216.
Caching with expiration times, P. Gopalan, H. Karloff, A. Mehta, M. Mihail, N. Vishnoi, Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, 2002, pp. 540-547.
Keeping Track of the Latest Gossip in Shared Memory Systems, B. Adsul, A. Mehta, M. Sohoni, Lecture notes in computer science (FSTTCS) (2000), pp. 477-488.