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 条
  • [21] Optimal Constraint Collection for Core-Selecting Path Mechanism
    Cheng, Hao
    Zhang, Lei
    Zhang, Yi
    Wu, Jun
    Wang, ChongJun
    PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS (AAMAS' 18), 2018, : 41 - 49
  • [22] Designing Core-selecting Payment Rules: A Computational Search Approach
    Bunz, Benedikt
    Lubin, Benjamin
    Seuken, Sven
    ACM EC'18: PROCEEDINGS OF THE 2018 ACM CONFERENCE ON ECONOMICS AND COMPUTATION, 2018, : 109 - 109
  • [23] An equilibrium analysis of a core-selecting package auction with reserve prices
    Sano, Ryuji
    REVIEW OF ECONOMIC DESIGN, 2018, 22 (3-4) : 101 - 122
  • [24] Designing Core-Selecting Payment Rules: A Computational Search Approach
    Bunz, Benedikt
    Lubin, Benjamin
    Seuken, Sven
    INFORMATION SYSTEMS RESEARCH, 2022, 33 (04) : 1157 - 1173
  • [25] An equilibrium analysis of a core-selecting package auction with reserve prices
    Ryuji Sano
    Review of Economic Design, 2018, 22 : 101 - 122
  • [26] Efficient Core-Selecting Incentive Mechanism for Data Sharing in Federated Learning
    Ji, Mengda
    Xu, Genjiu
    Ge, Jianjun
    Li, Mingqiang
    IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS, 2024, 11 (05) : 1 - 14
  • [27] Non-bidding equilibrium in an ascending core-selecting auction
    Sano, Ryuji
    GAMES AND ECONOMIC BEHAVIOR, 2012, 74 (02) : 637 - 650
  • [28] Core-Selecting Combinatorial Auction Design for Secondary Spectrum Markets
    Zhu, Yuefei
    Li, Baochun
    Li, Zongpeng
    2013 PROCEEDINGS IEEE INFOCOM, 2013, : 1986 - 1994
  • [29] A complexity approach for core-selecting exchange under conditionally lexicographic preferences
    Fujita, Etsushi
    Lesca, Julien
    Sonoda, Akihisa
    Todo, Taiki
    Yokoo, Makoto
    Journal of Artificial Intelligence Research, 2018, 63 : 515 - 555
  • [30] A Complexity Approach for Core-Selecting Exchange under Conditionally Lexicographic Preferences
    Fujita, Etsushi
    Lesca, Julien
    Sonoda, Akihisa
    Todo, Taiki
    Yokoo, Makoto
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2018, 63 : 515 - 555