On the impossibility of core-selecting auctions

被引:37
|
作者
Goeree, Jacob K. [1 ]
Lien, Yuanchuan [2 ]
机构
[1] Univ Technol Sydney, Econ Discipline Grp, Sydney, NSW 2007, Australia
[2] Hong Kong Univ Sci & Technol, Dept Econ, Hong Kong, Hong Kong, Peoples R China
基金
欧洲研究理事会;
关键词
Core outcomes; Vickrey auction; substitutes; complements; competitive equilibrium; Bayesian implementability; COMBINATORIAL AUCTIONS; PACKAGE AUCTIONS; MECHANISMS; EFFICIENT;
D O I
10.3982/TE1198
中图分类号
F [经济];
学科分类号
02 ;
摘要
When goods are substitutes, the Vickrey outcome is in the core and yields competitive seller revenue. In contrast, with complements, the Vickrey outcome is efficient but not necessarily in the core and revenue can be low. Non-core outcomes may be perceived as unfair since there are bidders willing to pay more than the winners' payments. Moreover, non-core outcomes render the auction vulnerable to defections, as the seller can attract better offers afterward. To avoid instabilities of this type, Day and Raghavan (2007), Day and Milgrom (2008), and Day and Cramton (2012) have suggested adapting the Vickrey pricing rule so that outcomes are in the core with respect to bidders' reported values. If truthful bidding were an equilibrium of the resulting auction, then the outcome would also be in the core with respect to bidders' true values. We show, however, that when the equilibrium outcome of any auction is in the core, it is equivalent to the Vickrey outcome. In other words, if the Vickrey outcome is not in the core, no core-selecting auction exists. Our results further imply that the competitive equilibrium outcome, which always exists when goods are substitutes, can only be implemented when it coincides with the Vickrey outcome. Finally, for a simple environment, we show that compared to Vickrey prices, the adapted pricing rule yields lower expected efficiency and revenue as well as outcomes that are on average further from the core.
引用
收藏
页码:41 / 52
页数:12
相关论文
共 50 条
  • [1] Core-selecting package auctions
    Day, Robert
    Milgrom, Paul
    INTERNATIONAL JOURNAL OF GAME THEORY, 2008, 36 (3-4) : 393 - 407
  • [2] Core-selecting package auctions
    Robert Day
    Paul Milgrom
    International Journal of Game Theory, 2008, 36 : 393 - 407
  • [3] Core-selecting auctions with incomplete information
    Ausubel, Lawrence M.
    Baranov, Oleg
    INTERNATIONAL JOURNAL OF GAME THEORY, 2020, 49 (01) : 251 - 273
  • [4] Core-selecting auctions with incomplete information
    Lawrence M. Ausubel
    Oleg Baranov
    International Journal of Game Theory, 2020, 49 : 251 - 273
  • [5] Core-Selecting Secondary Spectrum Auctions
    Zhu, Yuefei
    Li, Baochun
    Fu, Haoming
    Li, Zongpeng
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2014, 32 (11) : 2268 - 2279
  • [6] Quadratic Core-Selecting Payment Rules for Combinatorial Auctions
    Day, Robert W.
    Cramton, Peter
    OPERATIONS RESEARCH, 2012, 60 (03) : 588 - 603
  • [7] Risk aversion and loss aversion in core-selecting auctions
    Schneider, Mark
    Day, Robert
    Garfinkel, Robert
    DECISION SUPPORT SYSTEMS, 2015, 79 : 161 - 170
  • [8] A NEW PAYMENT RULE FOR CORE-SELECTING PACKAGE AUCTIONS
    Erdil, Aytek
    Klemperer, Paul
    JOURNAL OF THE EUROPEAN ECONOMIC ASSOCIATION, 2010, 8 (2-3) : 537 - 547
  • [9] Incentives in core-selecting auctions with single-minded bidders
    Sano, Ryuji
    GAMES AND ECONOMIC BEHAVIOR, 2011, 72 (02) : 602 - 606
  • [10] Core-Selecting Auctions for Autonomous Vehicle Public Transportation System
    Yu, James J. Q.
    Lam, Albert Y. S.
    IEEE SYSTEMS JOURNAL, 2019, 13 (02): : 2046 - 2056