Aranyak Mehta

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 34

Top Topics

Subset Selection

Budget Constraints

Bipartite Matching

Combinatorial Auctions

Top Venues

Publications

Kshipra Bhawalkar, Zhe Feng, Anupam Gupta, Aranyak Mehta, David Wajc, Di Wang
The Average-Value Allocation Problem. CoRR (2024)
Yang Cai, Zhe Feng, Christopher Liaw, Aranyak Mehta, Grigoris Velegkas
User Response in Ad Auctions: An MDP Formulation of Long-term Revenue Optimization. WWW (2024)
Avinava Dubey, Zhe Feng, Rahul Kidambi, Aranyak Mehta, Di Wang
Auctions with LLM Summaries. KDD (2024)
Yang Cai, Christopher Liaw, Aranyak Mehta, Mingfei Zhao
The Power of Two-Sided Recruitment in Two-Sided Markets. STOC (2024)
Martino Banchio, Aranyak Mehta, Andrés Perlroth
Auctions with Dynamic Scoring. CoRR (2024)
Kumar Avinava Dubey, Zhe Feng, Rahul Kidambi, Aranyak Mehta, Di Wang
Auctions with LLM Summaries. CoRR (2024)
Christopher Liaw, Aranyak Mehta, Wennan Zhu
Efficiency of Non-Truthful Auctions in Auto-bidding with Budget Constraints. WWW (2024)
Sai Srivatsa Ravindranath, Zhe Feng, Di Wang, Manzil Zaheer, Aranyak Mehta, David C. Parkes
Deep Reinforcement Learning for Sequential Combinatorial Auctions. CoRR (2024)
Kaiwen Wang, Rahul Kidambi, Ryan Sullivan, Alekh Agarwal, Christoph Dann, Andrea Michi, Marco Gelmi, Yunxuan Li, Raghav Gupta, Avinava Dubey, Alexandre Ramé, Johan Ferret, Geoffrey Cideron, Le Hou, Hongkun Yu, Amr Ahmed, Aranyak Mehta, Léonard Hussenot, Olivier Bachem, Edouard Leurent
Conditioned Language Policy: A General Framework for Steerable Multi-Objective Finetuning. CoRR (2024)
Guru Guruganesh, Aranyak Mehta, Di Wang, Kangning Wang
Prior-Independent Auctions for Heterogeneous Bidders. SODA (2024)
Yang Cai, Zhe Feng, Christopher Liaw, Aranyak Mehta
User Response in Ad Auctions: An MDP Formulation of Long-Term Revenue Optimization. CoRR (2023)
Kamyar Azizzadenesheli, Trung Dang, Aranyak Mehta, Alexandros Psomas, Qian Zhang
Reward Selection with Noisy Observations. CoRR (2023)
Yang Cai, Christopher Liaw, Aranyak Mehta, Mingfei Zhao
The Power of Two-sided Recruitment in Two-sided Markets. CoRR (2023)
Yeganeh Alimohammadi, Aranyak Mehta, Andrés Perlroth
Incentive Compatibility in the Auto-bidding World. CoRR (2023)
Christopher Liaw, Aranyak Mehta, Andrés Perlroth
Efficiency of Non-Truthful Auctions in Auto-bidding: The Power of Randomization. WWW (2023)
Andrés Perlroth, Aranyak Mehta
Auctions without commitment in the auto-bidding world. WWW (2023)
Yeganeh Alimohammadi, Aranyak Mehta, Andrés Perlroth
Incentive Compatibility in the Auto-bidding World. EC (2023)
Christopher Liaw, Aranyak Mehta, Wennan Zhu
Efficiency of Non-Truthful Auctions in Auto-bidding with Budget Constraints. CoRR (2023)
Aranyak Mehta, Andrés Perlroth
Auctions without commitment in the auto-bidding world. CoRR (2023)
Gagan Aggarwal, Kshipra Bhawalkar, Aranyak Mehta, Divyarthi Mohan, Alexandros Psomas
Simple Mechanisms for Welfare Maximization in Rich Advertising Auctions. NeurIPS (2022)
Aranyak Mehta
Auction Design in an Auto-bidding Setting: Randomization Improves Efficiency Beyond VCG. WWW (2022)
Guru Guruganesh, Aranyak Mehta, Di Wang, Kangning Wang
Prior-Independent Auctions for Heterogeneous Bidders. CoRR (2022)
Aranyak Mehta
Auction Design in an Auto-bidding Setting: Randomization Improves Efficiency Beyond VCG. CoRR (2022)
Christopher Liaw, Aranyak Mehta, Andrés Perlroth
Efficiency of non-truthful auctions under auto-bidding. CoRR (2022)
Gagan Aggarwal, Kshipra Bhawalkar, Aranyak Mehta, Divyarthi Mohan, Alexandros Psomas
Simple Mechanisms for Welfare Maximization in Rich Advertising Auctions. CoRR (2022)
Zhe Feng, Guru Guruganesh, Christopher Liaw, Aranyak Mehta, Abhishek Sethi
Convergence Analysis of No-Regret Bidding Algorithms in Repeated Auctions. AAAI (2021)
Aranyak Mehta, Uri Nadav, Alexandros Psomas, Aviad Rubinstein
Hitting the High Notes: Subset Selection for Maximizing Expected Order Statistics. CoRR (2020)
Goran Zuzic, Di Wang, Aranyak Mehta, D. Sivakumar
Learning Robust Algorithms for Online Allocation Problems Using Adversarial Training. CoRR (2020)
Aranyak Mehta, Uri Nadav, Alexandros Psomas, Aviad Rubinstein
Hitting the High Notes: Subset Selection for Maximizing Expected Order Statistics. NeurIPS (2020)
Zhe Feng, Guru Guruganesh, Christopher Liaw, Aranyak Mehta, Abhishek Sethi
Convergence Analysis of No-Regret Bidding Algorithms in Repeated Auctions. CoRR (2020)
Gagan Aggarwal, Ashwinkumar Badanidiyuru, Aranyak Mehta
Autobidding with Constraints. WINE (2019)
Weiwei Kong, Christopher Liaw, Aranyak Mehta, D. Sivakumar
A new dog learns old tricks: RL finds classic optimization algorithms. ICLR (Poster) (2019)
Shahar Dobzinski, Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan
Is Shapley cost sharing optimal? Games Econ. Behav. 108 (2018)
Florin Constantin, Christopher Harris, Samuel Ieong, Aranyak Mehta, Xi Tan
Optimizing Ad Refresh In Mobile App Advertising. WWW (2018)
Aranyak Mehta, Bo Waggoner, Morteza Zadimoghaddam
Online Stochastic Matching with Unequal Probabilities. SODA (2015)
Gagan Aggarwal, Yang Cai, Aranyak Mehta, George Pierrakos
Biobjective Online Bipartite Matching. WINE (2014)
Aranyak Mehta
Online Matching and Ad Allocation. Found. Trends Theor. Comput. Sci. 8 (4) (2013)
Yang Cai, Mohammad Mahdian, Aranyak Mehta, Bo Waggoner
Designing Markets for Daily Deals. WINE (2013)
Chinmay Karande, Aranyak Mehta, Ramakrishnan Srikant
Optimizing budget constrained spend in search advertising. WSDM (2013)
Yang Cai, Mohammad Mahdian, Aranyak Mehta, Bo Waggoner
Designing Markets for Daily Deals. CoRR (2013)
Bahman Bahmani, Aranyak Mehta, Rajeev Motwani
Online Graph Edge-Coloring in the Random-Order Arrival Model. Theory Comput. 8 (1) (2012)
Aranyak Mehta, Debmalya Panigrahi
Online Matching with Stochastic Rewards. FOCS (2012)
Gagan Aggarwal, Gagan Goel, Chinmay Karande, Aranyak Mehta
Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations. SODA (2011)
Chinmay Karande, Aranyak Mehta, Pushkar Tripathi
Online bipartite matching with unknown distributions. STOC (2011)
Robert Krauthgamer, Aranyak Mehta, Atri Rudra
Pricing commodities. Theor. Comput. Sci. 412 (7) (2011)
Gagan Aggarwal, Gagan Goel, Chinmay Karande, Aranyak Mehta
Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations CoRR (2010)
Bahman Bahmani, Aranyak Mehta, Rajeev Motwani
A 1.43-Competitive Online Graph Edge Coloring Algorithm in the Random Order Arrival Model. SODA (2010)
Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vazirani
Design is as Easy as Optimization. SIAM J. Discret. Math. 24 (1) (2010)
Mihail N. Kolountzakis, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta, Nisheeth K. Vishnoi
On the Fourier spectrum of symmetric Boolean functions. Comb. 29 (3) (2009)
Gagan Aggarwal, Gagan Goel, Aranyak Mehta
Efficiency of (Revenue-)Optimal Mechanisms CoRR (2009)
Jon Feldman, Aranyak Mehta, Vahab S. Mirrokni, S. Muthukrishnan
Online Stochastic Matching: Beating 1-1/e CoRR (2009)
Jon Feldman, Aranyak Mehta, Vahab S. Mirrokni, S. Muthukrishnan
Online Stochastic Matching: Beating 1-1/e. FOCS (2009)
Constantinos Daskalakis, Aranyak Mehta, Christos H. Papadimitriou
A note on approximate Nash equilibria. Theor. Comput. Sci. 410 (17) (2009)
Gagan Aggarwal, Gagan Goel, Aranyak Mehta
Efficiency of (revenue-)optimal mechanisms. EC (2009)
Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani
On Earthmover Distance, Metric Labeling, and 0-Extension. SIAM J. Comput. 39 (2) (2009)
Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan
Beyond Moulin mechanisms. Games Econ. Behav. 67 (1) (2009)
Gagan Goel, Aranyak Mehta
Online budgeted matching in random input models with applications to Adwords. SODA (2008)
Robert Krauthgamer, Aranyak Mehta, Vijayshankar Raman, Atri Rudra
Greedy List Intersection. ICDE (2008)
Shahar Dobzinski, Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan
Is Shapley Cost Sharing Optimal? SAGT (2008)
Subhash Khot, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta
Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions. Algorithmica 52 (1) (2008)
Constantinos Daskalakis, Aranyak Mehta, Christos H. Papadimitriou
Progress in approximate nash equilibria. EC (2007)
Gagan Goel, Aranyak Mehta
Adwords Auctions with Decreasing Valuation Bids. WINE (2007)
Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vijay V. Vazirani
AdWords and generalized online matching. J. ACM 54 (5) (2007)
Sanjiv Kapoor, Aranyak Mehta, Vijay V. Vazirani
An auction-based market equilibrium algorithm for a production model. Theor. Comput. Sci. 378 (2) (2007)
Rob LeGrand, Evangelos Markakis, Aranyak Mehta
Some results on approximating the minimax solution in approval voting. AAMAS (2007)
Robert Krauthgamer, Aranyak Mehta, Atri Rudra
Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations. WAOA (2007)
Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan
Beyond moulin mechanisms. EC (2007)
Constantinos Daskalakis, Aranyak Mehta, Christos H. Papadimitriou
A Note on Approximate Nash Equilibria. WINE (2006)
Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani
On earthmover distance, metric labeling, and 0-extension. STOC (2006)
Aranyak Mehta, Scott Shenker, Vijay V. Vazirani
Posted price profit maximization for multicast by approximating fixed points. J. Algorithms 58 (2) (2006)
Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vazirani
Design Is as Easy as Optimization. ICALP (1) (2006)
Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi
Caching with Expiration Times for Internet Applications. Internet Math. 2 (2) (2005)
Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Nagarajan
Fairness and optimality in congestion games. EC (2005)
Sanjiv Kapoor, Aranyak Mehta, Vijay V. Vazirani
An Auction-Based Market Equilibrium Algorithm for a Production Model. WINE (2005)
Kamal Jain, Aranyak Mehta, Kunal Talwar, Vijay V. Vazirani
A Simple Characterization for Truth-Revealing Single-Item Auctions. WINE (2005)
Subhash Khot, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta
Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions. WINE (2005)
Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani
On earthmover distance, metric labeling, and 0-extension Electron. Colloquium Comput. Complex. (064) (2005)
Richard J. Lipton, Evangelos Markakis, Aranyak Mehta, Nisheeth K. Vishnoi
On the Fourier Spectrum of Symmetric Boolean Functions with Applications to Learning Symmetric Juntas. Computational Complexity Conference (2005)
Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vijay V. Vazirani
AdWords and Generalized On-line Matching. FOCS (2005)
Aranyak Mehta, Vijay V. Vazirani
Randomized truthful auctions of digital goods are randomizations over truthful auctions. EC (2004)
Richard J. Lipton, Evangelos Markakis, Aranyak Mehta
Playing large games using simple strategies. EC (2003)
Aranyak Mehta, Scott Shenker, Vijay V. Vazirani
Profit-maximizing multicast pricing by approximating fixed points. EC (2003)
Parikshit Gopalan, Richard J. Lipton, Aranyak Mehta
Randomized Time-Space Tradeoffs for Directed Graph Connectivity. FSTTCS (2003)
Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi
Caching with expiration times. SODA (2002)
Bharat Adsul, Aranyak Mehta, Milind A. Sohoni
Keeping Track of the Latest Gossip in Shared Memory Systems. FSTTCS (2000)