Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Bhawalkar, Kshipra"'
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
We study revenue maximization for agents with additive preferences, subject to downward-closed constraints on the set of feasible allocations. In seminal work, Alaei~\cite{alaei2014bayesian} introduced a powerful multi-to-single agent reduction based
Externí odkaz:
http://arxiv.org/abs/2407.12699
We initiate the study of centralized algorithms for welfare-maximizing allocation of goods to buyers subject to average-value constraints. We show that this problem is NP-hard to approximate beyond a factor of $\frac{e}{e-1}$, and provide a $\frac{4e
Externí odkaz:
http://arxiv.org/abs/2407.10401
Generative AI (GenAI) will have significant impact on content creation platforms. In this paper, we study the dynamic competition between a GenAI and a human contributor. Unlike the human, the GenAI's content only improves when more contents are crea
Externí odkaz:
http://arxiv.org/abs/2406.05187
Autor:
Balseiro, Santiago R., Bhawalkar, Kshipra, Feng, Zhe, Lu, Haihao, Mirrokni, Vahab, Sivan, Balasubramanian, Wang, Di
Budget pacing is a popular service that has been offered by major internet advertising platforms since their inception. Budget pacing systems seek to optimize advertiser returns subject to budget constraints by smoothly spending advertiser budgets. I
Externí odkaz:
http://arxiv.org/abs/2302.08530
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 amounts of space, and an advertiser can provide multiple formats, only one
Externí odkaz:
http://arxiv.org/abs/2206.02948
We study the mechanism design problem of selling $k$ items to unit-demand buyers with private valuations for the items. A buyer either participates directly in the auction or is represented by an intermediary, who represents a subset of buyers. Our g
Externí odkaz:
http://arxiv.org/abs/2111.10472
Modern ad auctions allow advertisers to target more specific segments of the user population. Unfortunately, this is not always in the best interest of the ad platform. In this paper, we examine the following basic question in the context of second-p
Externí odkaz:
http://arxiv.org/abs/1708.00611
We undertake a formal study of the value of targeting data to an advertiser. As expected, this value is increasing in the utility difference between realizations of the targeting data and the accuracy of the data, and depends on the distribution of c
Externí odkaz:
http://arxiv.org/abs/1407.3338
Autor:
Balseiro, Santiago R., Bhawalkar, Kshipra, Feng, Zhe, Lu, Haihao, Mirrokni, Vahab, Sivan, Balasubramanian, Wang, Di
Budget pacing is a popular service that has been offered by major internet advertising platforms since their inception. Budget pacing systems seek to optimize advertiser returns subject to budget constraints through smooth spending of advertiser budg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3dbe0d19b67709b4e6c485274ceac664
http://arxiv.org/abs/2302.08530
http://arxiv.org/abs/2302.08530