activity
20052023
most citedOnline Stochastic Matching: Beating 1-1/e

40 citations · 78 across the 17 of their papers we have counts for

collaborators

17 papers

cs.GT2023

Reward Selection with Noisy Observations

Kamyar Azizzadenesheli, Trung Dang, Aranyak Mehta +2

We study a fundamental problem in optimization under uncertainty. There are boxes; each box contains a hidden reward . Rewards are drawn i.i.d. from an unknown distrib…

cs.GT2023

The Power of Two-sided Recruitment in Two-sided Markets

Yang Cai, Christopher Liaw, Aranyak Mehta +1

We consider the problem of maximizing the gains from trade (GFT) in two-sided markets. The seminal impossibility result by Myerson and Satterthwaite shows that even for bilateral t…

cs.GT2023

User Response in Ad Auctions: An MDP Formulation of Long-Term Revenue Optimization

Yang Cai, Zhe Feng, Christopher Liaw +2

We propose a new Markov Decision Process (MDP) model for ad auctions to capture the user response to the quality of ads, with the objective of maximizing the long-term discounted r…

econ.TH2023★ 2 cited

Incentive Compatibility in the Auto-bidding World

Yeganeh Alimohammadi, Aranyak Mehta, Andres Perlroth

Auto-bidding has recently become a popular feature in ad auctions. This feature enables advertisers to simply provide high-level constraints and goals to an automated agent, which…

econ.TH2023

Auctions without commitment in the auto-bidding world

Aranyak Mehta, Andres Perlroth

Advertisers in online ad auctions are increasingly using auto-bidding mechanisms to bid into auctions instead of directly bidding their value manually. One prominent auto-bidding f…

cs.GT2022★ 4 cited

Efficiency of non-truthful auctions under auto-bidding

Christopher Liaw, Aranyak Mehta, Andres Perlroth

Auto-bidding is now widely adopted as an interface between advertisers and internet advertising as it allows advertisers to specify high-level goals, such as maximizing value subje…