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

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

collaborators
Showing cs.GTShow all

11 papers · 1 filter

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…

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…

cs.GT2022

Prior-Independent Auctions for Heterogeneous Bidders

Guru Guruganesh, Aranyak Mehta, Di Wang +1

We study the design of prior-independent auctions in a setting with heterogeneous bidders. In particular, we consider the setting of selling to bidders whose values are drawn f…

cs.GT2022★ 2 cited

Simple Mechanisms for Welfare Maximization in Rich Advertising Auctions

Gagan Aggarwal, Kshipra Bhawalkar, Aranyak Mehta +2

Internet ad auctions have evolved from a few lines of text to richer informational layouts that include images, sitelinks, videos, etc. Ads in these new formats occupy varying amou…