论文标题
设计基于多臂匪徒的真实上下文赞助的搜索拍卖
Designing Truthful Contextual Multi-Armed Bandits based Sponsored Search Auctions
论文作者
论文摘要
对于赞助的搜索拍卖，我们考虑在战略代理的存在下考虑上下文的多军匪徒问题。在这种情况下，在每回合中，一个广告平台（中心）进行拍卖，以选择与用户发布的查询相关的最佳广告。中心选择具有高期望值的广告（即获得单击$ \ times $ value的概率）符合中心的最大利益。单击（CTR）的概率是中心未知的，取决于用户的配置文件（上下文）发布查询。此外，单击的值是向广告商提供的私人信息，因此需要真实地提出。这种设置中的现有解决方案是不可行的，因为它遭受了很高的遗憾（$ o（t^{\ frac {2} {3}}}}）$）。
For sponsored search auctions, we consider contextual multi-armed bandit problem in the presence of strategic agents. In this setting, at each round, an advertising platform (center) runs an auction to select the best-suited ads relevant to the query posted by the user. It is in the best interest of the center to select an ad that has a high expected value (i.e., probability of getting a click $\times$ value it derives from a click of the ad). The probability of getting a click (CTR) is unknown to the center and depends on the user's profile (context) posting the query. Further, the value derived for a click is the private information to the advertiser and thus needs to be elicited truthfully. The existing solution in this setting is not practical as it suffers from very high regret ($O(T^{\frac{2}{3}})$).
