自动竞价拍卖的前景:价值与效用最大化

S. Balseiro, Yuan Deng, Jieming Mao, V. Mirrokni, Song Zuo
{"title":"自动竞价拍卖的前景:价值与效用最大化","authors":"S. Balseiro, Yuan Deng, Jieming Mao, V. Mirrokni, Song Zuo","doi":"10.1145/3465456.3467607","DOIUrl":null,"url":null,"abstract":"Internet advertisers are increasingly adopting automated bidders to buy advertising opportunities. Automated bidders simplify the procurement process by allowing advertisers to specify their goals and then bidding on their behalf in the auctions that are used to sell advertising slots. One popular goal adopted by advertisers is to maximize their clicks (or conversions) subject to a return on spend (RoS) constraint, which imposes that the ratio of total value to total spend is greater than a target ratio specified by the advertisers. The emergence of automated bidders brings into question whether the standard mechanisms used to sell ads are still effective in this new landscape. Thus motivated, in this paper, we study the problem of characterizing optimal mechanisms for selling an item to one of multiple agents with return on spend constraints when either the values or target ratios are private. We consider two objectives for the agents: value maximization, which is becoming the prevalent objective in advertising markets, and utility maximization, which is the de facto paradigm in economic theory. Our goal is to understand the impact of the agents' private information and their objectives on the seller's revenue, and determine whether the first-best revenue, which is the optimal revenue when all the private information is public, is achievable. We show that first-best revenue is achievable for value-maximizing buyers when either the target ratio or the values are private, but not when both are private. In the case of utility-maximizing buyers, first-best is never achievable and we characterize revenue-maximizing mechanisms.","PeriodicalId":395676,"journal":{"name":"Proceedings of the 22nd ACM Conference on Economics and Computation","volume":"116 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"39","resultStr":"{\"title\":\"The Landscape of Auto-bidding Auctions: Value versus Utility Maximization\",\"authors\":\"S. Balseiro, Yuan Deng, Jieming Mao, V. Mirrokni, Song Zuo\",\"doi\":\"10.1145/3465456.3467607\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Internet advertisers are increasingly adopting automated bidders to buy advertising opportunities. Automated bidders simplify the procurement process by allowing advertisers to specify their goals and then bidding on their behalf in the auctions that are used to sell advertising slots. One popular goal adopted by advertisers is to maximize their clicks (or conversions) subject to a return on spend (RoS) constraint, which imposes that the ratio of total value to total spend is greater than a target ratio specified by the advertisers. The emergence of automated bidders brings into question whether the standard mechanisms used to sell ads are still effective in this new landscape. Thus motivated, in this paper, we study the problem of characterizing optimal mechanisms for selling an item to one of multiple agents with return on spend constraints when either the values or target ratios are private. We consider two objectives for the agents: value maximization, which is becoming the prevalent objective in advertising markets, and utility maximization, which is the de facto paradigm in economic theory. Our goal is to understand the impact of the agents' private information and their objectives on the seller's revenue, and determine whether the first-best revenue, which is the optimal revenue when all the private information is public, is achievable. We show that first-best revenue is achievable for value-maximizing buyers when either the target ratio or the values are private, but not when both are private. In the case of utility-maximizing buyers, first-best is never achievable and we characterize revenue-maximizing mechanisms.\",\"PeriodicalId\":395676,\"journal\":{\"name\":\"Proceedings of the 22nd ACM Conference on Economics and Computation\",\"volume\":\"116 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-02-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"39\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 22nd ACM Conference on Economics and Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3465456.3467607\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 22nd ACM Conference on Economics and Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3465456.3467607","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 39

摘要

互联网广告商越来越多地采用自动竞价来购买广告机会。通过允许广告商指定他们的目标,然后在用于出售广告位的拍卖中代表他们竞标,自动竞标简化了采购过程。广告商采用的一个普遍目标是在支出回报(RoS)约束下最大化他们的点击(或转化),即总价值与总支出的比率大于广告商指定的目标比率。自动竞价的出现让人质疑,在这种新形势下,用于销售广告的标准机制是否仍然有效。因此,在本文中,我们研究了当价值或目标比率为私有时,将商品出售给具有支出回报约束的多个代理之一的最优机制。我们考虑了代理人的两个目标:价值最大化,这正在成为广告市场的普遍目标,以及效用最大化,这是经济理论中事实上的范式。我们的目标是了解代理商的私人信息和他们的目标对卖方收益的影响,并确定当所有私人信息都是公开时的最优收益是否可以实现。我们表明,当目标比率或价值为私有时,价值最大化买家可以获得最佳收益,但当两者都为私有时则不行。在效用最大化购买者的情况下,第一最佳是永远无法实现的,我们描述了收入最大化机制。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The Landscape of Auto-bidding Auctions: Value versus Utility Maximization
Internet advertisers are increasingly adopting automated bidders to buy advertising opportunities. Automated bidders simplify the procurement process by allowing advertisers to specify their goals and then bidding on their behalf in the auctions that are used to sell advertising slots. One popular goal adopted by advertisers is to maximize their clicks (or conversions) subject to a return on spend (RoS) constraint, which imposes that the ratio of total value to total spend is greater than a target ratio specified by the advertisers. The emergence of automated bidders brings into question whether the standard mechanisms used to sell ads are still effective in this new landscape. Thus motivated, in this paper, we study the problem of characterizing optimal mechanisms for selling an item to one of multiple agents with return on spend constraints when either the values or target ratios are private. We consider two objectives for the agents: value maximization, which is becoming the prevalent objective in advertising markets, and utility maximization, which is the de facto paradigm in economic theory. Our goal is to understand the impact of the agents' private information and their objectives on the seller's revenue, and determine whether the first-best revenue, which is the optimal revenue when all the private information is public, is achievable. We show that first-best revenue is achievable for value-maximizing buyers when either the target ratio or the values are private, but not when both are private. In the case of utility-maximizing buyers, first-best is never achievable and we characterize revenue-maximizing mechanisms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信