Optimal auction design under non-commitment

被引:27
|
作者
Skreta, Vasiliki [1 ]
机构
[1] UCL, Dept Econ, London WC1E 6BT, England
基金
美国国家科学基金会; 美国安德鲁·梅隆基金会;
关键词
Mechanism design; Optimal auctions; Limited commitment; IMPERFECT COMMITMENT; REVELATION PRINCIPLE; RESERVE PRICES; INFORMATION; ECONOMICS; MONOPOLY; PRIVACY;
D O I
10.1016/j.jet.2015.04.007
中图分类号
F [经济];
学科分类号
02 ;
摘要
We characterize revenue-maximizing mechanisms in Myerson's (1981) environment when the seller behaves sequentially rationally, in the sense that she cannot commit not to propose a new mechanism if the previously chosen one fails to allocate the object. We show that the seller-optimal mechanism takes the same form as in the case when there is commitment: The seller maximizes revenue by assigning, at t = 1, the good to the buyer with the highest virtual valuation if it is above a buyer-specific reserve price. If no trade takes place at t = 1, at t = 2, the seller assigns the object to the buyer with the highest posterior virtual valuation, provided that it is above the seller's value. (C) 2015 Elsevier Inc. All rights reserved.
引用
收藏
页码:854 / 890
页数:37
相关论文
共 50 条