Zobrazeno 1 - 10
of 41
pro vyhledávání: '"Teng, Yifeng"'
Autor:
Aggarwal, Gagan, Badanidiyuru, Ashwinkumar, Balseiro, Santiago R., Bhawalkar, Kshipra, Deng, Yuan, Feng, Zhe, Goel, Gagan, Liaw, Christopher, Lu, Haihao, Mahdian, Mohammad, Mao, Jieming, Mehta, Aranyak, Mirrokni, Vahab, Leme, Renato Paes, Perlroth, Andres, Piliouras, Georgios, Schneider, Jon, Schvartzman, Ariel, Sivan, Balasubramanian, Spendlove, Kelly, Teng, Yifeng, Wang, Di, Zhang, Hanrui, Zhao, Mingfei, Zhu, Wennan, Zuo, Song
In this survey, we summarize recent developments in research fueled by the growing adoption of automated bidding strategies in online advertising. We explore the challenges and opportunities that have arisen as markets embrace this autobidding and co
Externí odkaz:
http://arxiv.org/abs/2408.07685
In this paper, we investigate a problem of actively learning threshold in latent space, where the unknown reward $g(\gamma, v)$ depends on the proposed threshold $\gamma$ and latent value $v$ and it can be $only$ achieved if the threshold is lower th
Externí odkaz:
http://arxiv.org/abs/2312.04653
In recent years, the growing adoption of autobidding has motivated the study of auction design with value-maximizing auto-bidders. It is known that under mild assumptions, uniform bid-scaling is an optimal bidding strategy in truthful auctions, e.g.,
Externí odkaz:
http://arxiv.org/abs/2311.10679
We consider the problem of evaluating forecasts of binary events whose predictions are consumed by rational agents who take an action in response to a prediction, but whose utility is unknown to the forecaster. We show that optimizing forecasts for a
Externí odkaz:
http://arxiv.org/abs/2307.00168
Autor:
Dütting, Paul, Gergatsouli, Evangelia, Rezvan, Rojin, Teng, Yifeng, Tsigonias-Dimitriadis, Alexandros
We study the prophet secretary problem, a well-studied variant of the classic prophet inequality, where values are drawn from independent known distributions but arrive in uniformly random order. Upon seeing a value at each step, the decision-maker h
Externí odkaz:
http://arxiv.org/abs/2305.11144
Publikováno v:
EC 2023
Myerson's regularity condition of a distribution is a standard assumption in economics. In this paper, we study the complexity of describing a regular distribution within a small statistical distance. Our main result is that $\tilde{\Theta}{(\epsilon
Externí odkaz:
http://arxiv.org/abs/2305.05590
A recent line of research has established a novel desideratum for designing approximately-revenue-optimal multi-item mechanisms, namely the buy-many constraint. Under this constraint, prices for different allocations made by the mechanism must be sub
Externí odkaz:
http://arxiv.org/abs/2204.01962
The common way to optimize auction and pricing systems is to set aside a small fraction of the traffic to run experiments. This leads to the question: how can we learn the most with the smallest amount of data? For truthful auctions, this is the \emp
Externí odkaz:
http://arxiv.org/abs/2111.03158
Autor:
Abolhassani, Melika, Esfandiari, Hossein, Nazari, Yasamin, Sivan, Balasubramanian, Teng, Yifeng, Thomas, Creighton
In this work, we study a scenario where a publisher seeks to maximize its total revenue across two sales channels: guaranteed contracts that promise to deliver a certain number of impressions to the advertisers, and spot demands through an Ad Exchang
Externí odkaz:
http://arxiv.org/abs/2107.06980
We study the worst-case welfare of item pricing in the \emph{tollbooth problem}. The problem was first introduced by Guruswami et al, and is a special case of the combinatorial auction in which (i) each of the $m$ items in the auction is an edge of s
Externí odkaz:
http://arxiv.org/abs/2107.05690