异质竞争者之间的竞争设计:全付费拍卖中平局和出价上限的实验研究

Nora Szech
{"title":"异质竞争者之间的竞争设计:全付费拍卖中平局和出价上限的实验研究","authors":"Nora Szech","doi":"10.2139/ssrn.2766732","DOIUrl":null,"url":null,"abstract":"We revisit the two bidder complete information all-pay auction with bid-caps introduced by Che and Gale (1998), dropping their assumption that tie-breaking must be symmetric. Any choice of tie-breaking rule leads to a different set of Nash equilibria. Compared to the optimal bid-cap of Che and Gale we obtain that in order to maximize the sum of bids, the designer prefers to set a less restrictive bid-cap combined with a tie-breaking rule which slightly favors the weaker bidder. Moreover, the designer is better off breaking ties deterministically in favor of the weak bidder than symmetrically.","PeriodicalId":410550,"journal":{"name":"CESifo: Behavioural Economics (Topic)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"56","resultStr":"{\"title\":\"Designing Contests between Heterogeneous Contestants: An Experimental Study of Tie-Breaks and Bid-Caps in All-Pay Auctions\",\"authors\":\"Nora Szech\",\"doi\":\"10.2139/ssrn.2766732\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We revisit the two bidder complete information all-pay auction with bid-caps introduced by Che and Gale (1998), dropping their assumption that tie-breaking must be symmetric. Any choice of tie-breaking rule leads to a different set of Nash equilibria. Compared to the optimal bid-cap of Che and Gale we obtain that in order to maximize the sum of bids, the designer prefers to set a less restrictive bid-cap combined with a tie-breaking rule which slightly favors the weaker bidder. Moreover, the designer is better off breaking ties deterministically in favor of the weak bidder than symmetrically.\",\"PeriodicalId\":410550,\"journal\":{\"name\":\"CESifo: Behavioural Economics (Topic)\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"56\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"CESifo: Behavioural Economics (Topic)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2139/ssrn.2766732\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"CESifo: Behavioural Economics (Topic)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.2766732","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 56

摘要

我们重新审视了两个竞标者完成信息全付拍卖的情况,该拍卖采用Che和Gale(1998)引入的出价上限,放弃了他们的假设,即平局必须是对称的。任何决胜规则的选择都会导致不同的纳什均衡。通过对比Che和Gale的最优出价上限,我们得到,为了使投标总数最大化,设计者倾向于设置限制性较小的出价上限,并结合打破平局规则,使较弱的投标人略占优势。此外,设计师最好是决定论地打破联系,以支持弱投标人,而不是对称地打破联系。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Designing Contests between Heterogeneous Contestants: An Experimental Study of Tie-Breaks and Bid-Caps in All-Pay Auctions
We revisit the two bidder complete information all-pay auction with bid-caps introduced by Che and Gale (1998), dropping their assumption that tie-breaking must be symmetric. Any choice of tie-breaking rule leads to a different set of Nash equilibria. Compared to the optimal bid-cap of Che and Gale we obtain that in order to maximize the sum of bids, the designer prefers to set a less restrictive bid-cap combined with a tie-breaking rule which slightly favors the weaker bidder. Moreover, the designer is better off breaking ties deterministically in favor of the weak bidder than symmetrically.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信