Dynamic Pricing and Bidding for Display Advertising Campaigns

投标 广告 动态定价 实时竞价 业务 展示广告 营销 微观经济学 经济 计算机科学 在线广告 互联网 万维网
作者
Narendra Agrawal,Sami Najafi Asadolahi,Stephen A. Smith
出处
期刊:Manufacturing & Service Operations Management [Institute for Operations Research and the Management Sciences]
卷期号:27 (3): 843-861 被引量:5
标识
DOI:10.1287/msom.2023.0600
摘要

Problem definition: Managers in digital ad agencies face the complex problem of setting prices for new ad campaigns, bidding for viewers on ad exchanges, and allocating them appropriately to campaigns. We have developed an analytical methodology for optimizing the agency’s profits, with uncertainties in the arrival of potential viewers and new ad campaigns and in winning bids and obtaining viewer actions on ad exchanges. Methodology/results: The ad agency manages a series of contracts with advertisers who wish to display their ads to randomly arriving targeted viewers. Advertisers differ in their delay costs and willingness to pay for obtaining various actions by these viewers. We formulate the ad agency’s sequential decision problem as a Markov decision process and develop exact solutions for both finite-horizon and steady-state cases. In our numerical analysis, we find that the finite-horizon dynamic programming (DP) solutions converge quickly to time-invariant policies, which are shown to be equivalent to the steady-state solutions. We also develop and test two heuristics that allow our solution methods to be scaled for large problems. Managerial implications: Several managerial implications follow from our paper, which is the first to address this multifaceted ad agency decision problem: (i) managers can exercise three key operational levers to maximize profits: campaign pricing, bidding strategy, and the queue capacity for campaign outcomes; (ii) the effectiveness of these levers varies in different situations, as illustrated by our numerical sensitivity analysis; (iii) optimal dynamic policies that depend on the queue length deliver significantly better profits than optimal static policies; (iv) appropriately designed heuristics can provide accurate solution methods that can be scaled to accommodate the large numbers of campaign outcomes frequently requested in practice; and (v) combining ad campaigns or merging ad agencies leads to higher total profits for the ad agency, lower prices for ad campaigns, and decreased delays in obtaining campaign outcomes. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2023.0600 .
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
woxinyouyou发布了新的文献求助20
1秒前
学渣完成签到,获得积分10
1秒前
dianhuaxue发布了新的文献求助10
2秒前
LGJ发布了新的文献求助10
2秒前
tanjiabin发布了新的文献求助10
2秒前
3秒前
3秒前
4秒前
4秒前
秋风的应助被醉熏的寄松采纳,获得10
6秒前
秋风的应助被醉熏的寄松采纳,获得10
6秒前
Maestro_S的应助被醉熏的寄松采纳,获得10
6秒前
7秒前
临床躺学发布了新的文献求助10
7秒前
可乐乐发布了新的文献求助10
7秒前
多情的仰发布了新的文献求助10
7秒前
快乐的紫寒完成签到,获得积分10
8秒前
xiao完成签到,获得积分10
8秒前
8秒前
9秒前
隐形曼青的应助被简单晓博采纳,获得10
9秒前
10秒前
泥头车发布了新的文献求助10
11秒前
11秒前
wz完成签到 ,获得积分10
11秒前
LGJ完成签到,获得积分10
11秒前
11秒前
12秒前
12秒前
乐乐的应助被Gloria2023采纳,获得20
12秒前
xixi发布了新的文献求助20
12秒前
12秒前
12秒前
嘎嘎嘎发布了新的文献求助10
12秒前
13秒前
sleblueep完成签到,获得积分10
13秒前
13秒前
13秒前
14秒前
14秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
拉伸高分子熔体中缠结行为的模拟和小角中子散射研究 1700
The World Atlas of Wine 9th edition 1000
奈特基础组织学:配套组织病理学(第4版)(Netter's Essential Histology With Correlated Histopathology) 800
八旗制度の研究 600
Improving the wear resistance of vehicle gear oil by oil soluble LaF3 nanoparticles and typical additives of gear oil 500
Boundaries and Bodhisattvas 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 工程类 有机化学 化学工程 生物化学 物理 复合材料 内科学 催化作用 光电子学 人工智能 细胞生物学 无机化学 物理化学 数学
热门帖子
关注 科研通微信公众号,转发送积分 8183263
求助须知:如何正确求助?哪些是违规求助? 9572532
关于积分的说明 21826339
捐赠科研通 7780187
什么是DOI,文献DOI怎么找? 3433993
关于科研通互助平台的介绍 2558131
邀请新用户注册赠送积分活动 2480239