Efficient and optimal selling procedures with private information acquisition costs

Jingfeng Lu, Lixin Ye
{"title":"Efficient and optimal selling procedures with private information acquisition costs","authors":"Jingfeng Lu, Lixin Ye","doi":"10.1145/1807406.1807450","DOIUrl":null,"url":null,"abstract":"In auctions with private information acquisition costs, we completely characterize efficient and optimal two-stage selling procedures, with the first stage being the prescreening or entry right allocation mechanism, and the second stage being the traditional private good provision mechanism. Both efficiency and optimality require the second stage mechanism to be ex post efficient. For the first stage of entry allocation, both efficient and optimal mechanisms admit the most efficient bidders (the bidders with the least information acquisition costs), while the optimal mechanism admits fewer entrants. The efficient entry right allocation rule maximizes the expected total surplus, while the optimal entry right allocation rule maximizes the expected \"virtual\" total surplus, which is the total surplus adjusted for the information rent. We show that both efficient and optimal entry right allocation rules can be truthfully implemented in dominant strategies. We also demonstrate that the optimal entry right allocation mechanism can be implemented through an all-pay auction.","PeriodicalId":142982,"journal":{"name":"Behavioral and Quantitative Game Theory","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2010-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Behavioral and Quantitative Game Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1807406.1807450","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In auctions with private information acquisition costs, we completely characterize efficient and optimal two-stage selling procedures, with the first stage being the prescreening or entry right allocation mechanism, and the second stage being the traditional private good provision mechanism. Both efficiency and optimality require the second stage mechanism to be ex post efficient. For the first stage of entry allocation, both efficient and optimal mechanisms admit the most efficient bidders (the bidders with the least information acquisition costs), while the optimal mechanism admits fewer entrants. The efficient entry right allocation rule maximizes the expected total surplus, while the optimal entry right allocation rule maximizes the expected "virtual" total surplus, which is the total surplus adjusted for the information rent. We show that both efficient and optimal entry right allocation rules can be truthfully implemented in dominant strategies. We also demonstrate that the optimal entry right allocation mechanism can be implemented through an all-pay auction.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
有效和最优的销售流程与私人信息获取成本
在具有私人信息获取成本的拍卖中,我们完整地描述了有效和最优的两阶段销售程序,第一阶段是预筛选或进入权分配机制,第二阶段是传统的私人物品提供机制。效率和最优性都要求第二阶段机制具有事后效率。在第一阶段,有效机制和最优机制都允许最有效的投标人(信息获取成本最小的投标人),而最优机制允许更少的投标人。有效的进入权配置规则使预期总剩余最大化,而最优的进入权配置规则使预期“虚拟”总剩余最大化,即经信息租金调整后的总剩余。我们证明了有效和最优的进入权分配规则都可以在优势策略中真实地实现。我们还证明了最优的进入权分配机制可以通过全付费拍卖来实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Game theory and operations management Cost sharing in distribution problems for franchise operations Subgame-perfection in positive recursive games Rationalizability, adaptive dynamics, and the correspondence principle in games with strategic substitutes Structural estimation of discrete-choice games of incomplete information with multiple equilibria
×
引用
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