Optimal Contracts for Intermediaries in Online Advertising

被引:22
作者
Balseiro, Santiago R. [1 ]
Candogan, Ozan [2 ]
机构
[1] Duke Univ, Fuqua Sch Business, Durham, NC 27708 USA
[2] Univ Chicago, Booth Sch Business, Chicago, IL 60637 USA
关键词
intermediary problems; mechanism design; Internet advertising; repeated auctions; budget constraints; FINANCIALLY CONSTRAINED BUYERS; QUEUING-SYSTEMS; OPTIMAL AUCTION;
D O I
10.1287/opre.2017.1618
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
In online advertising, the prevalent method advertisers employ to acquire impressions is to contract with an intermediary. These contracts involve upfront payments made by the advertisers to the intermediary, in exchange for running campaigns on their behalf. This paper studies the optimal contract offered by the intermediary in a setting where advertisers' budgets and targeting criteria are private. This problem can naturally be formulated as a multidimensional mechanism design problem, which in general is hard to solve. We tackle this problem by combining a performance space characterization technique, which relies on delineating the expected cost and value achievable by any feasible (dynamic) bidding policy, and a duality-based approach, which reduces the optimal contract design problem to a tractable convex optimization problem. This approach yields a crisp characterization of the intermediary's optimal bidding policy: the policy is stationary and bids a weighted average of the values associated with different types (to guarantee that the advertiser reports her type truthfully) that is appropriately shaded (to account for budget constraints). Additionally, when advertisers have identical value distributions, our formulation yields a closed-formcharacterization of the optimal contract. Our results indicate that an intermediary can profitably provide bidding service to a budget-constrained advertiser and at the same time increase the overall market efficiency.
引用
收藏
页码:878 / 896
页数:19
相关论文
共 34 条
[1]   Incentive-Compatible Revenue Management in Queueing Systems: Optimal Strategic Delay [J].
Afeche, Philipp .
M&SOM-MANUFACTURING & SERVICE OPERATIONS MANAGEMENT, 2013, 15 (03) :423-443
[2]  
Alaei S., 2012, ACM Conference on Electronic Commerce, P17
[3]  
[Anonymous], 1999, Athena scientific Belmont
[4]  
[Anonymous], 2005, Proc. ACM EC
[5]  
[Anonymous], 2000, Dynamic programming and optimal control
[6]  
[Anonymous], 2009, VARIATIONAL ANAL
[7]   Repeated Auctions with Budgets in Ad Exchanges: Approximations and Design [J].
Balseiro, Santiago R. ;
Besbes, Omar ;
Weintraub, Gabriel Y. .
MANAGEMENT SCIENCE, 2015, 61 (04) :864-884
[8]   The Relational Advantages of Intermediation [J].
Belavina, Elena ;
Girotra, Karan .
MANAGEMENT SCIENCE, 2012, 58 (09) :1614-1631
[9]   Conservation laws, extended polymatroids and multiarmed bandit problems; A polyhedral approach to indexable systems [J].
Bertsimas, D ;
Nino-Mora, J .
MATHEMATICS OF OPERATIONS RESEARCH, 1996, 21 (02) :257-306
[10]  
Bhattacharya S, 2010, ACM S THEORY COMPUT, P379