 | 2011 |
| 43 |  | Gagan Aggarwal,
Gagan Goel,
Chinmay Karande,
Aranyak Mehta:
Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations.
SODA 2011: 1253-1264 |
| 42 |  | Chinmay Karande,
Aranyak Mehta,
Pushkar Tripathi:
Online bipartite matching with unknown distributions.
STOC 2011: 587-596 |
| 41 |  | Robert Krauthgamer,
Aranyak Mehta,
Atri Rudra:
Pricing commodities.
Theor. Comput. Sci. 412(7): 602-613 (2011) |
| 2010 |
| 40 |  | 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 |
| 39 |  | Gagan Aggarwal,
Gagan Goel,
Chinmay Karande,
Aranyak Mehta:
Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations
CoRR abs/1007.1271: (2010) |
| 38 |  | Deeparnab Chakrabarty,
Aranyak Mehta,
Vijay V. Vazirani:
Design is as Easy as Optimization.
SIAM J. Discrete Math. 24(1): 270-286 (2010) |
| 2009 |
| 37 |  | Gagan Aggarwal,
Gagan Goel,
Aranyak Mehta:
Efficiency of (revenue-)optimal mechanisms.
ACM Conference on Electronic Commerce 2009: 235-242 |
| 36 |  | Jon Feldman,
Aranyak Mehta,
Vahab S. Mirrokni,
S. Muthukrishnan:
Online Stochastic Matching: Beating 1-1/e.
FOCS 2009: 117-126 |
| 35 |  | Jon Feldman,
Aranyak Mehta,
Vahab S. Mirrokni,
S. Muthukrishnan:
Online Stochastic Matching: Beating 1-1/e
CoRR abs/0905.4100: (2009) |
| 34 |  | Gagan Aggarwal,
Gagan Goel,
Aranyak Mehta:
Efficiency of (Revenue-)Optimal Mechanisms
CoRR abs/0906.1019: (2009) |
| 33 |  | 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) |
| 32 |  | Aranyak Mehta,
Tim Roughgarden,
Mukund Sundararajan:
Beyond Moulin mechanisms.
Games and Economic Behavior 67(1): 125-155 (2009) |
| 31 |  | 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) |
| 30 |  | Constantinos Daskalakis,
Aranyak Mehta,
Christos H. Papadimitriou:
A note on approximate Nash equilibria.
Theor. Comput. Sci. 410(17): 1581-1588 (2009) |
| 2008 |
| 29 |  | Robert Krauthgamer,
Aranyak Mehta,
Vijayshankar Raman,
Atri Rudra:
Greedy List Intersection.
ICDE 2008: 1033-1042 |
| 28 |  | Shahar Dobzinski,
Aranyak Mehta,
Tim Roughgarden,
Mukund Sundararajan:
Is Shapley Cost Sharing Optimal?
SAGT 2008: 327-336 |
| 27 |  | Gagan Goel,
Aranyak Mehta:
Online budgeted matching in random input models with applications to Adwords.
SODA 2008: 982-991 |
| 26 |  | Subhash Khot,
Richard J. Lipton,
Evangelos Markakis,
Aranyak Mehta:
Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions.
Algorithmica 52(1): 3-18 (2008) |
| 2007 |
| 25 |  | Rob LeGrand,
Evangelos Markakis,
Aranyak Mehta:
Some results on approximating the minimax solution in approval voting.
AAMAS 2007: 198 |
| 24 |  | Aranyak Mehta,
Tim Roughgarden,
Mukund Sundararajan:
Beyond moulin mechanisms.
ACM Conference on Electronic Commerce 2007: 1-10 |
| 23 |  | Constantinos Daskalakis,
Aranyak Mehta,
Christos H. Papadimitriou:
Progress in approximate nash equilibria.
ACM Conference on Electronic Commerce 2007: 355-358 |
| 22 |  | Robert Krauthgamer,
Aranyak Mehta,
Atri Rudra:
Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations.
WAOA 2007: 1-14 |
| 21 |  | Gagan Goel,
Aranyak Mehta:
Adwords Auctions with Decreasing Valuation Bids.
WINE 2007: 335-340 |
| 20 |  | Aranyak Mehta,
Amin Saberi,
Umesh V. Vazirani,
Vijay V. Vazirani:
AdWords and generalized online matching.
J. ACM 54(5): (2007) |
| 19 |  | 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) |
| 2006 |
| 18 |  | Deeparnab Chakrabarty,
Aranyak Mehta,
Vijay V. Vazirani:
Design Is as Easy as Optimization.
ICALP (1) 2006: 477-488 |
| 17 |  | Howard J. Karloff,
Subhash Khot,
Aranyak Mehta,
Yuval Rabani:
On earthmover distance, metric labeling, and 0-extension.
STOC 2006: 547-556 |
| 16 |  | Constantinos Daskalakis,
Aranyak Mehta,
Christos H. Papadimitriou:
A Note on Approximate Nash Equilibria.
WINE 2006: 297-306 |
| 15 |  | Aranyak Mehta,
Scott Shenker,
Vijay V. Vazirani:
Posted price profit maximization for multicast by approximating fixed points.
J. Algorithms 58(2): 150-164 (2006) |
| 2005 |
| 14 |  | Deeparnab Chakrabarty,
Aranyak Mehta,
Viswanath Nagarajan:
Fairness and optimality in congestion games.
ACM Conference on Electronic Commerce 2005: 52-57 |
| 13 |  | Aranyak Mehta,
Amin Saberi,
Umesh V. Vazirani,
Vijay V. Vazirani:
AdWords and Generalized On-line Matching.
FOCS 2005: 264-273 |
| 12 |  | 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 |
| 11 |  | Sanjiv Kapoor,
Aranyak Mehta,
Vijay V. Vazirani:
An Auction-Based Market Equilibrium Algorithm for a Production Model.
WINE 2005: 102-111 |
| 10 |  | Kamal Jain,
Aranyak Mehta,
Kunal Talwar,
Vijay V. Vazirani:
A Simple Characterization for Truth-Revealing Single-Item Auctions.
WINE 2005: 122-128 |
| 9 |  | Subhash Khot,
Richard J. Lipton,
Evangelos Markakis,
Aranyak Mehta:
Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions.
WINE 2005: 92-101 |
| 8 |  | 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) |
| 7 |  | 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) |
| 2004 |
| 6 |  | 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 |
| 5 |  | Aranyak Mehta,
Scott Shenker,
Vijay V. Vazirani:
Profit-maximizing multicast pricing by approximating fixed points.
ACM Conference on Electronic Commerce 2003: 218-219 |
| 4 |  | Richard J. Lipton,
Evangelos Markakis,
Aranyak Mehta:
Playing large games using simple strategies.
ACM Conference on Electronic Commerce 2003: 36-41 |
| 3 |  | Parikshit Gopalan,
Richard J. Lipton,
Aranyak Mehta:
Randomized Time-Space Tradeoffs for Directed Graph Connectivity.
FSTTCS 2003: 208-216 |
| 2002 |
| 2 |  | Parikshit Gopalan,
Howard J. Karloff,
Aranyak Mehta,
Milena Mihail,
Nisheeth K. Vishnoi:
Caching with expiration times.
SODA 2002: 540-547 |
| 2000 |
| 1 |  | Bharat Adsul,
Aranyak Mehta,
Milind A. Sohoni:
Keeping Track of the Latest Gossip in Shared Memory Systems.
FSTTCS 2000: 477-488 |