Spread, then target, and advertise in waves: Optimal capital allocation across advertising channels

S. Eshghi, V. Preciado, S. Sarkar, S. Venkatesh, Qing Zhao, R. D’Souza, A. Swami
{"title":"Spread, then target, and advertise in waves: Optimal capital allocation across advertising channels","authors":"S. Eshghi, V. Preciado, S. Sarkar, S. Venkatesh, Qing Zhao, R. D’Souza, A. Swami","doi":"10.1109/ITA.2017.8023469","DOIUrl":null,"url":null,"abstract":"We obtain optimal strategies for the allocation of influence budget across multiple channels and across time for an external influencer, e.g., a political campaign, seeking to maximize its effect on an election given a network of agents with linear consensus-seeking opinion dynamics. We show that for a general set of objective functions, the optimal influence strategy at every time uses all channels at either their maximum rate or not at all. Furthermore, we prove that the number of switches between these extremes is bounded above both by a term that is typically much smaller than the number of agents. This means that the optimal influence strategy is to exert maximum effort in waves for every channel, and then cease effort and let the effects propagate. We also show that at the beginning, the total cost-adjusted reach of a channel determines its relative value, while targeting matters more closer to election time. We demonstrate that the optimal influence structures are easily computable in several practical cases. We explicitly characterize the optimal controls for the case of linear objective functions via a closed form. Finally, we see that in the canonical election example, identifying late-deciders approximately determines the optimal campaign resource allocation strategy.","PeriodicalId":305510,"journal":{"name":"2017 Information Theory and Applications Workshop (ITA)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Information Theory and Applications Workshop (ITA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITA.2017.8023469","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

We obtain optimal strategies for the allocation of influence budget across multiple channels and across time for an external influencer, e.g., a political campaign, seeking to maximize its effect on an election given a network of agents with linear consensus-seeking opinion dynamics. We show that for a general set of objective functions, the optimal influence strategy at every time uses all channels at either their maximum rate or not at all. Furthermore, we prove that the number of switches between these extremes is bounded above both by a term that is typically much smaller than the number of agents. This means that the optimal influence strategy is to exert maximum effort in waves for every channel, and then cease effort and let the effects propagate. We also show that at the beginning, the total cost-adjusted reach of a channel determines its relative value, while targeting matters more closer to election time. We demonstrate that the optimal influence structures are easily computable in several practical cases. We explicitly characterize the optimal controls for the case of linear objective functions via a closed form. Finally, we see that in the canonical election example, identifying late-deciders approximately determines the optimal campaign resource allocation strategy.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
先传播,再定位,再分波投放:跨广告渠道的最优资金配置
对于外部影响者,我们获得了跨多个渠道和跨时间分配影响力预算的最佳策略,例如,在给定具有线性共识寻求意见动态的代理网络的情况下,寻求最大限度地发挥其对选举的影响的政治运动。我们表明,对于一组一般的目标函数,每次的最优影响策略要么以最大速率使用所有通道,要么根本不使用。此外,我们证明了在这两个极端之间切换的数量是由一个通常比代理数量小得多的项限定的。这意味着最优的影响策略是在每个渠道上以波浪的形式施加最大的努力,然后停止努力,让效果传播。我们还表明,在一开始,一个渠道的总成本调整后的覆盖范围决定了它的相对价值,而目标更接近选举时间。我们在几个实际案例中证明了最优影响结构是容易计算的。对于线性目标函数,我们通过一个封闭形式明确地描述了最优控制。最后,我们看到,在典型的选举例子中,识别晚决策者大致决定了最优的竞选资源分配策略。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A novel index coding scheme and its application to coded caching Multidimensional index modulation in wireless communications Claude Shannon in Chess Review Device-aware routing and scheduling in multi-hop Device-to-Device networks Power-performance analysis of a simple one-bit transceiver
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1