An Asymptotically Tight Learning Algorithm for Mobile-Promotion Platforms

投标 后悔 计算机科学 集合(抽象数据类型) 晋升(国际象棋) 区间(图论) 印象 运筹学 数学优化 经济 广告 业务 微观经济学 数学 万维网 机器学习 组合数学 政治 政治学 法学 程序设计语言
作者
Zhichao Feng,Milind Dawande,Ganesh Janakiraman,Anyan Qi
出处
期刊:Management Science [Institute for Operations Research and the Management Sciences]
卷期号:69 (3): 1536-1554 被引量:9
标识
DOI:10.1287/mnsc.2022.4441
摘要

Operating under both supply-side and demand-side uncertainties, a mobile-promotion platform conducts advertising campaigns for individual advertisers. Campaigns arrive dynamically over time, which is divided into seasons; each campaign requires the platform to deliver a target number of mobile impressions from a desired set of locations over a desired time interval. The platform fulfills these campaigns by procuring impressions from publishers, who supply advertising space on apps via real-time bidding on ad exchanges. Each location is characterized by its win curve, that is, the relationship between the bid price and the probability of winning an impression at that bid. The win curves at the various locations of interest are initially unknown to the platform, and it learns them on the fly based on the bids it places to win impressions and the realized outcomes. Each acquired impression is allocated to one of the ongoing campaigns. The platform’s objective is to minimize its total cost (the amount spent in procuring impressions and the penalty incurred due to unmet targets of the campaigns) over the time horizon of interest. Our main result is a bidding and allocation policy for this problem. We show that our policy is the best possible (asymptotically tight) for the problem using the notion of regret under a policy, namely the difference between the expected total cost under that policy and the optimal cost for the clairvoyant problem (i.e., one in which the platform has full information about the win curves at all the locations in advance): The lower bound on the regret under any policy is of the order of the square root of the number of seasons, and the regret under our policy matches this lower bound. We demonstrate the performance of our policy through numerical experiments on a test bed of instances whose input parameters are based on our observations at a real-world mobile-promotion platform. This paper was accepted by Baris Ata, stochastic models and simulation. Supplemental Material: The online appendices are available at https://doi.org/10.1287/mnsc.2022.4441 .
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
大力可燕完成签到,获得积分10
刚刚
刚刚
鳗鱼丹秋发布了新的文献求助10
1秒前
1秒前
1秒前
1秒前
demi2333发布了新的文献求助10
1秒前
完美世界的应助被憨憨采纳,获得10
2秒前
Code_king发布了新的文献求助10
2秒前
伊韵_Wynne完成签到,获得积分10
2秒前
2秒前
zy发布了新的文献求助20
2秒前
3秒前
3秒前
3秒前
Code_king发布了新的文献求助10
3秒前
玩具卡完成签到,获得积分10
4秒前
4秒前
4秒前
4秒前
chipmunk发布了新的文献求助10
4秒前
Code_king发布了新的文献求助10
4秒前
4秒前
5秒前
qinry完成签到,获得积分10
5秒前
Code_king发布了新的文献求助10
5秒前
Duan发布了新的文献求助10
5秒前
gogogo驳回了Jun的应助
5秒前
5秒前
sing完成签到 ,获得积分10
5秒前
Code_king发布了新的文献求助10
6秒前
Code_king发布了新的文献求助10
6秒前
勤劳的小蜜蜂完成签到,获得积分10
6秒前
Code_king发布了新的文献求助10
6秒前
爆米花的应助被lk采纳,获得10
6秒前
追寻可愁完成签到,获得积分10
6秒前
clio发布了新的文献求助10
6秒前
执着尔冬完成签到 ,获得积分10
6秒前
科研通AI6.3的应助被瘦瘦靴采纳,获得10
7秒前
7秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
拉伸高分子熔体中缠结行为的模拟和小角中子散射研究 1700
奈特基础组织学:配套组织病理学(第4版)(Netter's Essential Histology With Correlated Histopathology) 800
John McDowells Bildungstheorie 800
八旗制度の研究 600
plantTFDB 508
高分子基功能界面水蒸发材料与应用研究 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 工程类 有机化学 化学工程 生物化学 物理 复合材料 内科学 催化作用 光电子学 人工智能 细胞生物学 无机化学 物理化学 数学
热门帖子
关注 科研通微信公众号,转发送积分 8176573
求助须知:如何正确求助?哪些是违规求助? 9567927
关于积分的说明 21795369
捐赠科研通 7771232
什么是DOI,文献DOI怎么找? 3432070
关于科研通互助平台的介绍 2556429
邀请新用户注册赠送积分活动 2477707