2013
45Optimizing budget constrained spend in search advertising. Chinmay Karande, Aranyak Mehta, Ramakrishnan Srikant. WSDM 2013, 697-706. Web SearchBibTeXDownload
2012
44Online Matching with Stochastic Rewards. Aranyak Mehta, Debmalya Panigrahi. FOCS 2012, 728-737. Web SearchBibTeXDownload
43Online Graph Edge-Coloring in the Random-Order Arrival Model. Bahman Bahmani, Aranyak Mehta, Rajeev Motwani. Theory of Computing (8): 567-595 (2012). Web SearchBibTeXDownload
2011
42Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations. Gagan Aggarwal, Gagan Goel, Chinmay Karande, Aranyak Mehta. SODA 2011, 1253-1264. Web SearchBibTeXDownload
41Online bipartite matching with unknown distributions. Chinmay Karande, Aranyak Mehta, Pushkar Tripathi. STOC 2011, 587-596. Web SearchBibTeXDownload
40Pricing commodities. Robert Krauthgamer, Aranyak Mehta, Atri Rudra. Theor. Comput. Sci. (412): 602-613 (2011). Web SearchBibTeXDownload
2010
39Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations. Gagan Aggarwal, Gagan Goel, Chinmay Karande, Aranyak Mehta. CoRR (abs/1007.1271) (2010). Web SearchBibTeXDownload
38Design is as Easy as Optimization. Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vazirani. SIAM J. Discrete Math. (24): 270-286 (2010). Web SearchBibTeXDownload
37A 1.43-Competitive Online Graph Edge Coloring Algorithm in the Random Order Arrival Model. Bahman Bahmani, Aranyak Mehta, Rajeev Motwani. SODA 2010, 31-39. Web SearchBibTeXDownload
2009
36Efficiency of (revenue-)optimal mechanisms. Gagan Aggarwal, Gagan Goel, Aranyak Mehta. ACM Conference on Electronic Commerce 2009, 235-242. Cited by 2Web SearchBibTeXDownload
35On the Fourier spectrum of symmetric Boolean functions. Mihail N. Kolountzakis, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta, Nisheeth K. Vishnoi. Combinatorica (29): 363-387 (2009). Web SearchBibTeXDownload
34Online Stochastic Matching: Beating 1-1/e. Jon Feldman, Aranyak Mehta, Vahab S. Mirrokni, S. Muthukrishnan. CoRR (abs/0905.4100) (2009). Cited by 1Web SearchBibTeXDownload
33Efficiency of (Revenue-)Optimal Mechanisms. Gagan Aggarwal, Gagan Goel, Aranyak Mehta. CoRR (abs/0906.1019) (2009). Web SearchBibTeXDownload
32Beyond Moulin mechanisms. Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan. Games and Economic Behavior (67): 125-155 (2009). Web SearchBibTeXDownload
31On Earthmover Distance, Metric Labeling, and 0-Extension. Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani. SIAM J. Comput. (39): 371-387 (2009). Web SearchBibTeXDownload
30A note on approximate Nash equilibria. Constantinos Daskalakis, Aranyak Mehta, Christos H. Papadimitriou. Theor. Comput. Sci. (410): 1581-1588 (2009). Web SearchBibTeXDownload
2008
29Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions. Subhash Khot, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta. Algorithmica (52): 3-18 (2008). Cited by 34Web SearchBibTeXDownload
28Greedy List Intersection. Robert Krauthgamer, Aranyak Mehta, Vijayshankar Raman, Atri Rudra. ICDE 2008, 1033-1042. Web SearchBibTeXDownload
27Is Shapley Cost Sharing Optimal?. Shahar Dobzinski, Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan. SAGT 2008, 327-336. Web SearchBibTeXDownload
26Online budgeted matching in random input models with applications to Adwords. Gagan Goel, Aranyak Mehta. SODA 2008, 982-991. Web SearchBibTeXDownload
2007
25Some results on approximating the minimax solution in approval voting. Rob LeGrand, Evangelos Markakis, Aranyak Mehta. AAMAS 2007, 198. Web SearchBibTeXDownload
24Progress in approximate nash equilibria. Constantinos Daskalakis, Aranyak Mehta, Christos H. Papadimitriou. ACM Conference on Electronic Commerce 2007, 355-358. Web SearchBibTeXDownload
23Beyond moulin mechanisms. Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan. ACM Conference on Electronic Commerce 2007, 1-10. Web SearchBibTeXDownload
22AdWords and generalized online matching. Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vijay V. Vazirani. J. ACM (54) (2007). Web SearchBibTeXDownload
21An auction-based market equilibrium algorithm for a production model. Sanjiv Kapoor, Aranyak Mehta, Vijay V. Vazirani. Theor. Comput. Sci. (378): 153-164 (2007). Web SearchBibTeXDownload
20Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations. Robert Krauthgamer, Aranyak Mehta, Atri Rudra. WAOA 2007, 1-14. Web SearchBibTeXDownload
19Adwords Auctions with Decreasing Valuation Bids. Gagan Goel, Aranyak Mehta. WINE 2007, 335-340. Web SearchBibTeXDownload
2006
18Design Is as Easy as Optimization. Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vazirani. ICALP (1) 2006, 477-488. Web SearchBibTeXDownload
17Posted price profit maximization for multicast by approximating fixed points. Aranyak Mehta, Scott Shenker, Vijay V. Vazirani. J. Algorithms (58): 150-164 (2006). Web SearchBibTeXDownload
16On earthmover distance, metric labeling, and 0-extension. Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani. STOC 2006, 547-556. Cited by 5Web SearchBibTeXDownload
15A Note on Approximate Nash Equilibria. Constantinos Daskalakis, Aranyak Mehta, Christos H. Papadimitriou. WINE 2006, 297-306. Web SearchBibTeXDownload
2005
14Fairness and optimality in congestion games. Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Nagarajan. ACM Conference on Electronic Commerce 2005, 52-57. Web SearchBibTeXDownload
13On earthmover distance, metric labeling, and 0-extension. Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani. Electronic Colloquium on Computational Complexity (ECCC) 2005. Cited by 5Web SearchBibTeXDownload
12AdWords and Generalized On-line Matching. Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vijay V. Vazirani. FOCS 2005, 264-273. Web SearchBibTeXDownload
11On the Fourier Spectrum of Symmetric Boolean Functions with Applications to Learning Symmetric Juntas. Richard J. Lipton, Evangelos Markakis, Aranyak Mehta, Nisheeth K. Vishnoi. IEEE Conference on Computational Complexity 2005, 112-119. Web SearchBibTeXDownload
10Caching with Expiration Times for Internet Applications. Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi. Internet Mathematics (2): 165-184 (2005). Web SearchBibTeXDownload
9Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions. Subhash Khot, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta. WINE 2005, 92-101. Cited by 34Web SearchBibTeXDownload
8An Auction-Based Market Equilibrium Algorithm for a Production Model. Sanjiv Kapoor, Aranyak Mehta, Vijay V. Vazirani. WINE 2005, 102-111. Web SearchBibTeXDownload
7A Simple Characterization for Truth-Revealing Single-Item Auctions. Kamal Jain, Aranyak Mehta, Kunal Talwar, Vijay V. Vazirani. WINE 2005, 122-128. Web SearchBibTeXDownload
2004
6Randomized truthful auctions of digital goods are randomizations over truthful auctions. Aranyak Mehta, Vijay V. Vazirani. ACM Conference on Electronic Commerce 2004, 120-124. Web SearchBibTeXDownload
2003
5Playing large games using simple strategies. Richard J. Lipton, Evangelos Markakis, Aranyak Mehta. ACM Conference on Electronic Commerce 2003, 36-41. Web SearchBibTeXDownload
4Profit-maximizing multicast pricing by approximating fixed points. Aranyak Mehta, Scott Shenker, Vijay V. Vazirani. ACM Conference on Electronic Commerce 2003, 218-219. Web SearchBibTeXDownload
3Randomized Time-Space Tradeoffs for Directed Graph Connectivity. Parikshit Gopalan, Richard J. Lipton, Aranyak Mehta. FSTTCS 2003, 208-216. Web SearchBibTeXDownload
2002
2Caching with expiration times. Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi. SODA 2002, 540-547. Web SearchBibTeXDownload
2000
1Keeping Track of the Latest Gossip in Shared Memory Systems. Bharat Adsul, Aranyak Mehta, Milind A. Sohoni. FSTTCS 2000, 477-488. Web SearchBibTeXDownload
from DBLP and Google Scholar

Related People

Related Topics

Developed by the Database Group at the University of Wisconsin and Yahoo! Research