中文
相关论文

相关论文: Auctions Meet Bandits: An Empirical Analysis

200 篇论文

Over the last decade, digital media (web or app publishers) generalized the use of real time ad auctions to sell their ad spaces. Multiple auction platforms, also called Supply-Side Platforms (SSP), were created. Because of this…

For sponsored search auctions, we consider contextual multi-armed bandit problem in the presence of strategic agents. In this setting, at each round, an advertising platform (center) runs an auction to select the best-suited ads relevant to…

计算机科学与博弈论 · 计算机科学 2020-02-27 Kumar Abhishek , Shweta Jain , Sujit Gujar

This paper presents a bidding system for sponsored search auctions under an unknown valuation model. This formulation assumes that the bidder's value is unknown, evolving arbitrarily, and observed only upon winning an auction. Unlike…

计算机科学与博弈论 · 计算机科学 2024-05-15 Danil Provodin , Jérémie Joudioux , Eduard Duryev

Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been a lot of attention on the auction process and its game-theoretic aspects, our focus is on the advertisers. In particular,…

数据结构与算法 · 计算机科学 2007-05-23 Jon Feldman , S. Muthukrishnan , Martin Pal , Cliff Stein

The majority of online marketplaces offer promotion programs to sellers to acquire additional customers for their products. These programs typically allow sellers to allocate advertising budgets to promote their products, with higher…

计算机科学与博弈论 · 计算机科学 2025-02-05 Anastasiia Soboleva , Alexander Ledovsky , Yuriy Dorn , Egor Samosvat , Andrey Tikhanov , Fyodor Prazdnikov

Ad auctions in sponsored search support ``broad match'' that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving more expressiveness to advertisers, this feature makes it challenging…

计算机科学与博弈论 · 计算机科学 2009-01-26 Eyal Even-dar , Yishay Mansour , Vahab Mirrokni , S. Muthukrishnan , Uri Nadav

Sponsored search becomes an easy platform to match potential consumers' intent with merchants' advertising. Advertisers express their willingness to pay for each keyword in terms of bids to the search engine. When a user's query matches the…

计算机科学与博弈论 · 计算机科学 2012-07-20 Chenyang Li , Mingyi Hong , Randy Cogill , Alfredo Garcia

Real-time bidding (RTB) systems, which utilize auctions to allocate user impressions to competing advertisers, continue to enjoy success in digital advertising. Assessing the effectiveness of such advertising remains a challenge in research…

机器学习 · 计算机科学 2024-02-27 Caio Waisman , Harikesh S. Nair , Carlos Carrion

In pay-per click sponsored search auctions which are currently extensively used by search engines, the auction for a keyword involves a certain number of advertisers (say k) competing for available slots (say m) to display their ads. This…

计算机科学与博弈论 · 计算机科学 2010-01-17 Akash Das Sarma , Sujit Gujar , Y. Narahari

Sponsored search is an important monetization channel for search engines, in which an auction mechanism is used to select the ads shown to users and determine the prices charged from advertisers. There have been several pieces of work in…

计算机科学与博弈论 · 计算机科学 2014-06-05 Di He , Wei Chen , Liwei Wang , Tie-Yan Liu

Sponsored search in E-commerce platforms such as Amazon, Taobao and Tmall provides sellers an effective way to reach potential buyers with most relevant purpose. In this paper, we study the auction mechanism optimization problem in…

计算机科学与博弈论 · 计算机科学 2018-08-02 Gang Bai , Zhihui Xie , Liang Wang

In a sponsored search auction the advertisement slots on a search result page are generally ordered by click-through rate. Bidders have a valuation, which is usually assumed to be linear in the click-through rate, a budget constraint, and…

计算机科学与博弈论 · 计算机科学 2011-12-30 Riccardo Colini-Baldeschi , Monika Henzinger , Stefano Leonardi , Martin Starnberger

Recent work has addressed the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions so as to maximize revenue, most of which assume that pricing is done via a first-price auction. This does not…

数据结构与算法 · 计算机科学 2008-09-12 Yossi Azar , Benjamin Birnbaum , Anna R. Karlin , C. Thach Nguyen

Online advertising platforms often face a common challenge: the cold start problem. Insufficient behavioral data (clicks) makes accurate click-through rate (CTR) forecasting of new ads challenging. CTR for "old" items can also be…

机器学习 · 计算机科学 2025-02-05 Anastasiia Soboleva , Andrey Pudovikov , Roman Snetkov , Alina Babenko , Egor Samosvat , Yuriy Dorn

Contemporary real-world online ad auctions differ from canonical models [Edelman et al., 2007; Varian, 2009] in at least four ways: (1) values and click-through rates can depend upon users' search queries, but advertisers can only partially…

机器学习 · 计算机科学 2024-04-11 Ming Chen , Sareh Nabi , Marciano Siniscalchi

Sponsored search involves running an auction among advertisers who bid in order to have their ad shown next to search results for specific keywords. Currently, the most popular auction for sponsored search is the "Generalized Second Price"…

计算机科学与博弈论 · 计算机科学 2008-05-07 Gagan Aggarwal , Jon Feldman , S. Muthukrishnan , Martin Pal

Recommendation systems when employed in markets play a dual role: they assist users in selecting their most desired items from a large pool and they help in allocating a limited number of items to the users who desire them the most. Despite…

机器学习 · 计算机科学 2022-08-01 Yigit Efe Erginbas , Soham Phade , Kannan Ramchandran

Modern commercial Internet search engines display advertisements along side the search results in response to user queries. Such sponsored search relies on market mechanisms to elicit prices for these advertisements, making use of an…

计算机科学与博弈论 · 计算机科学 2008-12-18 Jon Feldman , S. Muthukrishnan

In online advertising markets, budget-constrained advertisers acquire ad placements through repeated bidding in auctions on various platforms. We present a strategy for bidding optimally in a set of auctions that may or may not be…

计算机科学与博弈论 · 计算机科学 2023-06-14 Fransisca Susan , Negin Golrezaei , Okke Schrijvers

We consider the problem of online allocation subject to a long-term fairness penalty. Contrary to existing works, however, we do not assume that the decision-maker observes the protected attributes -- which is often unrealistic in practice.…

机器学习 · 计算机科学 2023-12-05 Mathieu Molina , Nicolas Gast , Patrick Loiseau , Vianney Perchet
‹ 上一页 1 2 3 10 下一页 ›