中文
相关论文

相关论文: Optimizing Cost per Click for Digital Advertising …

200 篇论文

We introduce a new budgeted framework for online influence maximization, considering the total cost of an advertising campaign instead of the common cardinality constraint on a chosen influencer set. Our approach better models the…

机器学习 · 计算机科学 2026-04-22 Pierre Perrault , Jennifer Healey , Zheng Wen , Michal Valko

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

Incrementality, which is used to measure the causal effect of showing an ad to a potential customer (e.g. a user in an internet platform) versus not, is a central object for advertisers in online advertising platforms. This paper…

机器学习 · 计算机科学 2023-01-18 Ashwinkumar Badanidiyuru , Zhe Feng , Tianxi Li , Haifeng Xu

The optimization of bidding strategies for online advertising slot auctions presents a critical challenge across numerous digital marketplaces. A significant obstacle to the development, evaluation, and refinement of real-time autobidding…

We improve the best known competitive ratio (from 1/4 to 1/2), for the online multi-unit allocation problem, where the objective is to maximize the single-price revenue. Moreover, the competitive ratio of our algorithm tends to 1, as the…

计算机科学与博弈论 · 计算机科学 2009-01-13 Sourav Chakraborty , Nikhil Devanur

Clickbait is a pejorative term describing web content that is aimed at generating online advertising revenue, especially at the expense of quality or accuracy, relying on sensationalist headlines or eye-catching thumbnail pictures to…

计算与语言 · 计算机科学 2017-10-10 Vijayasaradhi Indurthi , Subba Reddy Oota

A typical real-time ad-serving funnel comprises ad targeting, conversion modeling (e.g., click-through rate prediction), budget pacing (bidding), and auction processes. While there is a wealth of research and articles on ad targeting and…

计算机科学与博弈论 · 计算机科学 2025-03-11 Yuanlong Chen

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

We consider dynamic pricing schemes in online settings where selfish agents generate online events. Previous work on online mechanisms has dealt almost entirely with the goal of maximizing social welfare or revenue in an auction settings.…

计算机科学与博弈论 · 计算机科学 2015-04-07 Ilan Reuven Cohen , Alon Eden , Amos Fiat , Łukasz Jeż

Being an emerging paradigm for display advertising, Real-Time Bidding (RTB) drives the focus of the bidding strategy from context to users' interest by computing a bid for each impression in real time. The data mining work and particularly…

计算机科学与博弈论 · 计算机科学 2015-05-22 Weinan Zhang , Shuai Yuan , Jun Wang , Xuehua Shen

Click-through rate (CTR) prediction is a critical task in online advertising systems. Most existing methods mainly model the feature-CTR relationship and suffer from the data sparsity issue. In this paper, we propose DeepMCP, which models…

机器学习 · 计算机科学 2019-07-22 Wentao Ouyang , Xiuwu Zhang , Shukui Ren , Chao Qi , Zhaojie Liu , Yanlong Du

We want to find the optimal strategy for displaying advertisements e.g. banners, videos, in given locations at given times under some realistic dynamic constraints. Our primary goal is to maximize the expected revenue in a given period of…

信息检索 · 计算机科学 2010-11-25 Fabrizio Caruso , Giovanni Giuffrida

We model the interaction between a user and an AI driven recommendation system. The user initiates the process by conveying preference information through a costly and noisy message. The AI assistant, acting as a Bayesian agent, interprets…

人工智能 · 计算机科学 2026-05-26 Jing Dong , Prakirt Raj Jhunjhunwala , Yash Kanoria

We consider a stochastic online problem where $n$ applicants arrive over time, one per time step. Upon arrival of each applicant their cost per time step is revealed, and we have to fix the duration of employment, starting immediately. This…

数据结构与算法 · 计算机科学 2017-05-31 Yann Disser , John Fearnley , Martin Gairing , Oliver Göbel , Max Klimm , Daniel Schmand , Alexander Skopalik , Andreas Tönnis

User marketing is a key focus of consumer-based internet companies. Learning algorithms are effective to optimize marketing campaigns which increase user engagement, and facilitates cross-marketing to related products. By attracting users…

机器学习 · 计算机科学 2020-04-24 Will Y. Zou , Shuyang Du , James Lee , Jan Pedersen

Campaigners are increasingly using online social networking platforms for promoting products, ideas and information. A popular method of promoting a product or even an idea is incentivizing individuals to evangelize the idea vigorously by…

社会与信息网络 · 计算机科学 2016-06-17 Bhushan Kotnis , Joy Kuri

Pricing decisions of companies require an understanding of the causal effect of a price change on the demand. When real-life pricing experiments are infeasible, data-driven decision-making must be based on alternative data sources such as…

应用统计 · 统计学 2024-07-03 Lauri Valkonen , Santtu Tikka , Jouni Helske , Juha Karvanen

In online internet advertising, machine learning models are widely used to compute the likelihood of a user engaging with product related advertisements. However, the performance of traditional machine learning models is often impacted due…

信息检索 · 计算机科学 2018-06-22 Marcelo Tallis , Pranjul Yadav

Consider a network design application where we wish to lay down a minimum-cost spanning tree in a given graph; however, we only have stochastic information about the edge costs. To learn the precise cost of any edge, we have to conduct a…

数据结构与算法 · 计算机科学 2017-11-02 Sahil Singla

Recommender systems are often optimised for short-term reward: a recommendation is considered successful if a reward (e.g. a click) can be observed immediately after the recommendation. The advantage of this framework is that with some…

信息检索 · 计算机科学 2020-09-02 Philomène Chagniot , Flavian Vasile , David Rohde
‹ 上一页 1 8 9 10 下一页 ›