Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Aranyak Mehta
2010 – today
- 2013
[c30]Chinmay Karande, Aranyak Mehta, Ramakrishnan Srikant: Optimizing budget constrained spend in search advertising. WSDM 2013: 697-706- 2012
- [j12]Bahman Bahmani, Aranyak Mehta, Rajeev Motwani: Online Graph Edge-Coloring in the Random-Order Arrival Model. Theory of Computing 8(1): 567-595 (2012)
- [c29]
- 2011
- [j11]Robert Krauthgamer, Aranyak Mehta, Atri Rudra: Pricing commodities. Theor. Comput. Sci. 412(7): 602-613 (2011)
- [c28]Gagan Aggarwal, Gagan Goel, Chinmay Karande, Aranyak Mehta: Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations. SODA 2011: 1253-1264
- [c27]Chinmay Karande, Aranyak Mehta, Pushkar Tripathi: Online bipartite matching with unknown distributions. STOC 2011: 587-596
- 2010
- [j10]Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vazirani: Design is as Easy as Optimization. SIAM J. Discrete Math. 24(1): 270-286 (2010)
- [c26]Bahman Bahmani, Aranyak Mehta, Rajeev Motwani: A 1.43-Competitive Online Graph Edge Coloring Algorithm in the Random Order Arrival Model. SODA 2010: 31-39
- [i4]Gagan Aggarwal, Gagan Goel, Chinmay Karande, Aranyak Mehta: Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations. CoRR abs/1007.1271 (2010)
2000 – 2009
- 2009
- [j9]Mihail N. Kolountzakis, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta, Nisheeth K. Vishnoi: On the Fourier spectrum of symmetric Boolean functions. Combinatorica 29(3): 363-387 (2009)
- [j8]Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan: Beyond Moulin mechanisms. Games and Economic Behavior 67(1): 125-155 (2009)
- [j7]Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani: On Earthmover Distance, Metric Labeling, and 0-Extension. SIAM J. Comput. 39(2): 371-387 (2009)
- [j6]Constantinos Daskalakis, Aranyak Mehta, Christos H. Papadimitriou: A note on approximate Nash equilibria. Theor. Comput. Sci. 410(17): 1581-1588 (2009)
- [c25]Jon Feldman, Aranyak Mehta, Vahab S. Mirrokni, S. Muthukrishnan: Online Stochastic Matching: Beating 1-1/e. FOCS 2009: 117-126
- [c24]Gagan Aggarwal, Gagan Goel, Aranyak Mehta: Efficiency of (revenue-)optimal mechanisms. ACM Conference on Electronic Commerce 2009: 235-242
- [i3]Jon Feldman, Aranyak Mehta, Vahab S. Mirrokni, S. Muthukrishnan: Online Stochastic Matching: Beating 1-1/e. CoRR abs/0905.4100 (2009)
- [i2]Gagan Aggarwal, Gagan Goel, Aranyak Mehta: Efficiency of (Revenue-)Optimal Mechanisms. CoRR abs/0906.1019 (2009)
- 2008
- [j5]Subhash Khot, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta: Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions. Algorithmica 52(1): 3-18 (2008)
- [c23]Robert Krauthgamer, Aranyak Mehta, Vijayshankar Raman, Atri Rudra: Greedy List Intersection. ICDE 2008: 1033-1042
- [c22]Shahar Dobzinski, Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan: Is Shapley Cost Sharing Optimal? SAGT 2008: 327-336
- [c21]Gagan Goel, Aranyak Mehta: Online budgeted matching in random input models with applications to Adwords. SODA 2008: 982-991
- 2007
- [j4]Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vijay V. Vazirani: AdWords and generalized online matching. J. ACM 54(5) (2007)
- [j3]Sanjiv Kapoor, Aranyak Mehta, Vijay V. Vazirani: An auction-based market equilibrium algorithm for a production model. Theor. Comput. Sci. 378(2): 153-164 (2007)
- [c20]Rob LeGrand, Evangelos Markakis, Aranyak Mehta: Some results on approximating the minimax solution in approval voting. AAMAS 2007: 198
- [c19]Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan: Beyond moulin mechanisms. ACM Conference on Electronic Commerce 2007: 1-10
- [c18]Constantinos Daskalakis, Aranyak Mehta, Christos H. Papadimitriou: Progress in approximate nash equilibria. ACM Conference on Electronic Commerce 2007: 355-358
- [c17]Robert Krauthgamer, Aranyak Mehta, Atri Rudra: Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations. WAOA 2007: 1-14
- [c16]
- 2006
- [j2]Aranyak Mehta, Scott Shenker, Vijay V. Vazirani: Posted price profit maximization for multicast by approximating fixed points. J. Algorithms 58(2): 150-164 (2006)
- [c15]Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vazirani: Design Is as Easy as Optimization. ICALP (1) 2006: 477-488
- [c14]Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani: On earthmover distance, metric labeling, and 0-extension. STOC 2006: 547-556
- [c13]Constantinos Daskalakis, Aranyak Mehta, Christos H. Papadimitriou: A Note on Approximate Nash Equilibria. WINE 2006: 297-306
- 2005
- [j1]Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi: Caching with Expiration Times for Internet Applications. Internet Mathematics 2(2): 165-184 (2005)
- [c12]Richard J. Lipton, Evangelos Markakis, Aranyak Mehta, Nisheeth K. Vishnoi: On the Fourier Spectrum of Symmetric Boolean Functions with Applications to Learning Symmetric Juntas. IEEE Conference on Computational Complexity 2005: 112-119
- [c11]Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vijay V. Vazirani: AdWords and Generalized On-line Matching. FOCS 2005: 264-273
- [c10]Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Nagarajan: Fairness and optimality in congestion games. ACM Conference on Electronic Commerce 2005: 52-57
- [c9]Subhash Khot, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta: Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions. WINE 2005: 92-101
- [c8]Sanjiv Kapoor, Aranyak Mehta, Vijay V. Vazirani: An Auction-Based Market Equilibrium Algorithm for a Production Model. WINE 2005: 102-111
- [c7]Kamal Jain, Aranyak Mehta, Kunal Talwar, Vijay V. Vazirani: A Simple Characterization for Truth-Revealing Single-Item Auctions. WINE 2005: 122-128
- [i1]Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani: On earthmover distance, metric labeling, and 0-extension. Electronic Colloquium on Computational Complexity (ECCC)(064) (2005)
- 2004
- [c6]Aranyak Mehta, Vijay V. Vazirani: Randomized truthful auctions of digital goods are randomizations over truthful auctions. ACM Conference on Electronic Commerce 2004: 120-124
- 2003
- [c5]Parikshit Gopalan, Richard J. Lipton, Aranyak Mehta: Randomized Time-Space Tradeoffs for Directed Graph Connectivity. FSTTCS 2003: 208-216
- [c4]Richard J. Lipton, Evangelos Markakis, Aranyak Mehta: Playing large games using simple strategies. ACM Conference on Electronic Commerce 2003: 36-41
- [c3]Aranyak Mehta, Scott Shenker, Vijay V. Vazirani: Profit-maximizing multicast pricing by approximating fixed points. ACM Conference on Electronic Commerce 2003: 218-219
- 2002
- [c2]Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi: Caching with expiration times. SODA 2002: 540-547
- 2000
- [c1]Bharat Adsul, Aranyak Mehta, Milind A. Sohoni: Keeping Track of the Latest Gossip in Shared Memory Systems. FSTTCS 2000: 477-488
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-02-15 22:12 CET by the dblp team