基于位置的个性化移动广告随机优化框架

P. Spentzouris, I. Koutsopoulos
{"title":"基于位置的个性化移动广告随机优化框架","authors":"P. Spentzouris, I. Koutsopoulos","doi":"10.23919/WIOPT.2017.7959886","DOIUrl":null,"url":null,"abstract":"Mobile location-based advertising has seen a lot of progress recently. We study the problem of optimal user targeting and monetization through advertising, from the point of view of the owner of a venue such as a shopping mall, an urban shopping district or an airport. The fundamental distinguishing characteristic of advertising in this setup is that the probability that the user will respond to an ad depends on timeliness of ad projection, hence it is important to target a mobile user with an appropriate ad or offer at the right time. A set of mobile users roam around the venue. Each user is profiled in terms of preferences based on prior visits. The system knows estimated instantaneous locations of users in the venue, e.g. through WiFi access point connectivity. A machine-learning model is used to derive a per-user time-varying probability of response to an ad, which depends on the relevance of the ad (store) to the user profile and on the time-varying physical proximity of the user to the store. Each store has a set of available ads, and each time the user responds to a projected ad, an amount is paid by the store to the venue owner. We use a stochastic-optimization framework based on Lyapunov optimization to address the problem of advertisement selection and allocation for maximizing the long-term average revenue of the venue owner subject to: (i) a constraint on maximum average ad projection rate per user for preventing user saturation, and (ii) a long-term average budget constraint for each store. We derive an algorithm that operates on a time slot basis by solving a simple assignment problem with instantaneous user locations while being agnostic to user mobility statistics. We test our algorithm with a real dataset of check-ins from Foursquare, complemented with data from user questionnaires. Our approach results in substantial improvement in revenue compared to approaches that are location- or relevance-agnostic.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"57 1","pages":"1-8"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A Stochastic optimization framework for personalized location-based mobile advertising\",\"authors\":\"P. Spentzouris, I. Koutsopoulos\",\"doi\":\"10.23919/WIOPT.2017.7959886\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mobile location-based advertising has seen a lot of progress recently. We study the problem of optimal user targeting and monetization through advertising, from the point of view of the owner of a venue such as a shopping mall, an urban shopping district or an airport. The fundamental distinguishing characteristic of advertising in this setup is that the probability that the user will respond to an ad depends on timeliness of ad projection, hence it is important to target a mobile user with an appropriate ad or offer at the right time. A set of mobile users roam around the venue. Each user is profiled in terms of preferences based on prior visits. The system knows estimated instantaneous locations of users in the venue, e.g. through WiFi access point connectivity. A machine-learning model is used to derive a per-user time-varying probability of response to an ad, which depends on the relevance of the ad (store) to the user profile and on the time-varying physical proximity of the user to the store. Each store has a set of available ads, and each time the user responds to a projected ad, an amount is paid by the store to the venue owner. We use a stochastic-optimization framework based on Lyapunov optimization to address the problem of advertisement selection and allocation for maximizing the long-term average revenue of the venue owner subject to: (i) a constraint on maximum average ad projection rate per user for preventing user saturation, and (ii) a long-term average budget constraint for each store. We derive an algorithm that operates on a time slot basis by solving a simple assignment problem with instantaneous user locations while being agnostic to user mobility statistics. We test our algorithm with a real dataset of check-ins from Foursquare, complemented with data from user questionnaires. Our approach results in substantial improvement in revenue compared to approaches that are location- or relevance-agnostic.\",\"PeriodicalId\":6630,\"journal\":{\"name\":\"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)\",\"volume\":\"57 1\",\"pages\":\"1-8\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/WIOPT.2017.7959886\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/WIOPT.2017.7959886","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

基于位置的移动广告最近取得了很大进展。我们从购物中心、城市购物区或机场等场所所有者的角度,研究通过广告实现最佳用户定位和盈利的问题。在这种情况下,广告的基本特征是,用户对广告做出反应的可能性取决于广告投放的及时性,因此,在合适的时间向移动用户投放合适的广告或优惠非常重要。一组移动用户在会场周围漫游。每个用户都是根据先前访问的偏好来描述的。该系统可通过WiFi接入点连接等方式,估测使用者在场地内的瞬时位置。机器学习模型用于推导每个用户对广告响应的时变概率,这取决于广告(商店)与用户配置文件的相关性以及用户与商店的时变物理距离。每个商店都有一组可用的广告,每次用户响应预计的广告时,商店就会向场地所有者支付一笔费用。我们使用基于Lyapunov优化的随机优化框架来解决广告选择和分配问题,以最大限度地提高场地所有者的长期平均收入,但要遵守:(i)对每个用户的最大平均广告投投放率的约束,以防止用户饱和;(ii)对每个商店的长期平均预算约束。我们推导了一种基于时隙的算法,该算法通过解决具有瞬时用户位置的简单分配问题,同时不受用户移动统计数据的影响。我们用Foursquare的真实签到数据集来测试我们的算法,并辅以用户问卷调查的数据。与位置或相关性无关的方法相比,我们的方法在收入方面取得了实质性的改善。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Stochastic optimization framework for personalized location-based mobile advertising
Mobile location-based advertising has seen a lot of progress recently. We study the problem of optimal user targeting and monetization through advertising, from the point of view of the owner of a venue such as a shopping mall, an urban shopping district or an airport. The fundamental distinguishing characteristic of advertising in this setup is that the probability that the user will respond to an ad depends on timeliness of ad projection, hence it is important to target a mobile user with an appropriate ad or offer at the right time. A set of mobile users roam around the venue. Each user is profiled in terms of preferences based on prior visits. The system knows estimated instantaneous locations of users in the venue, e.g. through WiFi access point connectivity. A machine-learning model is used to derive a per-user time-varying probability of response to an ad, which depends on the relevance of the ad (store) to the user profile and on the time-varying physical proximity of the user to the store. Each store has a set of available ads, and each time the user responds to a projected ad, an amount is paid by the store to the venue owner. We use a stochastic-optimization framework based on Lyapunov optimization to address the problem of advertisement selection and allocation for maximizing the long-term average revenue of the venue owner subject to: (i) a constraint on maximum average ad projection rate per user for preventing user saturation, and (ii) a long-term average budget constraint for each store. We derive an algorithm that operates on a time slot basis by solving a simple assignment problem with instantaneous user locations while being agnostic to user mobility statistics. We test our algorithm with a real dataset of check-ins from Foursquare, complemented with data from user questionnaires. Our approach results in substantial improvement in revenue compared to approaches that are location- or relevance-agnostic.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Keynote speaker Keynote speaker Ad-Hoc, Mobile, and Wireless Networks: 19th International Conference on Ad-Hoc Networks and Wireless, ADHOC-NOW 2020, Bari, Italy, October 19–21, 2020, Proceedings Retraction Note to: Mobility Aided Context-Aware Forwarding Approach for Destination-Less OppNets Ad-Hoc, Mobile, and Wireless Networks: 18th International Conference on Ad-Hoc Networks and Wireless, ADHOC-NOW 2019, Luxembourg, Luxembourg, October 1–3, 2019, Proceedings
×
引用
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