Myerson 1981 - Optimal auction design

Myerson 1981 - Optimal auction design

ID:39410190

大小:421.00 KB

页数:16页

时间:2019-07-02

Myerson 1981 - Optimal auction design_第1页
Myerson 1981 - Optimal auction design_第2页
Myerson 1981 - Optimal auction design_第3页
Myerson 1981 - Optimal auction design_第4页
Myerson 1981 - Optimal auction design_第5页
Myerson 1981 - Optimal auction design_第6页
Myerson 1981 - Optimal auction design_第7页
Myerson 1981 - Optimal auction design_第8页
Myerson 1981 - Optimal auction design_第9页
Myerson 1981 - Optimal auction design_第10页
资源描述:

《Myerson 1981 - Optimal auction design》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、MATHEMATICSOFOPERATIONSRESEARCHVol.6,No.1.February1981PrintedinU.S.A.OPTIMALAUCTIONDESIGN*?ROGERB.MYERSONNorthwesternUniversityThispaperconsiderstheproblemfacedbyasellerwhohasasingleobjecttoselltooneofseveralpossiblebuyers,whenthesellerhasimperfectinformationabouthowmuchthebuyersmightbewillingto

2、payfortheobject.Theseller'sproblemistodesignanauctiongamewhichhasaNashequilibriumgivinghimthehighestpossibleexpectedutility.Optimalauctionsarederivedinthispaperforawideclassofauctiondesignproblems.1.Introduction.Considertheproblemfacedbysomeonewhohasanobjecttosell,andwhodoesnotknowhowmuchhispros

3、pectivebuyersmightbewillingtopayfortheobject.Thissellerwouldliketofindsomeauctionprocedurewhichcangivehimthehighestexpectedrevenueorutilityamongallthedifferentkindsofauctionsknown(progressiveauctions,Dutchauctions,sealedbidauctions,discriminatoryauctions,etc.).Inthispaper,wewillconstructsuchopti

4、malauctionsforawideclassofsellers'auctiondesignproblems.Althoughtheseauctionsgenerallyselltheobjectatadiscountbelowwhatthehighestbidderiswillingtopay,andsometimestheydonotevenselltohighestbidder,weshallprovethatnootherauctionmechanismcangivehigherexpectedutilitytotheseller.Toanalyzethepotentialp

5、erformanceofdifferentkindsofauctions,wefollowVickrey[l11andstudytheauctionsasnoncooperativegameswithimperfectinforma-tion.(SeeHarsanyi[3]formoreonthissubject.)Noncooperativeequilibriaofspecificauctionshavebeenstudiedinseveralpapers,suchasGriesmer,Levitan,andShubik[I],Ortega-Reichert[7],Wilson[12

6、],[13].Wilson[14]andMilgrom[5]haveshownasymptoticoptimalitypropertiesforsealed-bidauctionsasthenumberofbiddersgoestoinfinity.HarrisandRaviv[2]havefoundoptimalauctionsforaclassofsymmetrictwo-bidderauctionproblems.IndependentworkonoptimalauctionshasalsobeendonebyRileyandSamuelson[8]andMaskinandRil

7、ey[4].AgeneralbibliographyoftheliteratureoncompetitivebiddinghasbeencollectedbyRothkopfandStark[lo].Thegeneralplanofthispaperisasfollows.$2presentsthebasicassumptionsandnotationneededtodescribetheclassofauctiondesignproblems

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。