IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2402.09321.html
   My bibliography  Save this paper

Collusion-Resilience in Transaction Fee Mechanism Design

Author

Listed:
  • Hao Chung
  • Tim Roughgarden
  • Elaine Shi

Abstract

Users bid in a transaction fee mechanism (TFM) to get their transactions included and confirmed by a blockchain protocol. Roughgarden (EC'21) initiated the formal treatment of TFMs and proposed three requirements: user incentive compatibility (UIC), miner incentive compatibility (MIC), and a form of collusion-resilience called OCA-proofness. Ethereum's EIP-1559 mechanism satisfies all three properties simultaneously when there is no contention between transactions, but loses the UIC property when there are too many eligible transactions to fit in a single block. Chung and Shi (SODA'23) considered an alternative notion of collusion-resilience, called c-side-constract-proofness (c-SCP), and showed that, when there is contention between transactions, no TFM can satisfy UIC, MIC, and c-SCP for any c at least 1. OCA-proofness asserts that the users and a miner should not be able to "steal from the protocol" and is intuitively weaker than the c-SCP condition, which stipulates that a coalition of a miner and a subset of users should not be able to profit through strategic deviations (whether at the expense of the protocol or of the users outside the coalition). Our main result is the first proof that, when there is contention between transactions, no (possibly randomized) direct-revelation TFM satisfies UIC, MIC, and OCA-proofness. This result resolves the main open question in Roughgarden(EC'21). We also suggest several relaxations of the basic model that allow our impossibility result to be circumvented.

Suggested Citation

  • Hao Chung & Tim Roughgarden & Elaine Shi, 2024. "Collusion-Resilience in Transaction Fee Mechanism Design," Papers 2402.09321, arXiv.org.
    • Handle: RePEc:arx:papers:2402.09321
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2402.09321
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Tim Roughgarden, 2020. "Transaction Fee Mechanism Design for the Ethereum Blockchain: An Economic Analysis of EIP-1559," Papers 2012.00854, arXiv.org.
    2. Matheus V. X. Ferreira & Daniel J. Moroz & David C. Parkes & Mitchell Stern, 2021. "Dynamic Posted-Price Mechanisms for the Blockchain Transaction Fee Market," Papers 2103.14144, arXiv.org, revised Nov 2021.
    3. Maryam Bahrani & Pranav Garimidi & Tim Roughgarden, 2023. "Transaction Fee Mechanism Design with Active Block Producers," Papers 2307.01686, arXiv.org, revised Oct 2023.
    4. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hao Chung & Elaine Shi, 2021. "Foundations of Transaction Fee Mechanism Design," Papers 2111.03151, arXiv.org, revised Nov 2022.
    2. Luyao Zhang & Fan Zhang, 2023. "Understand Waiting Time in Transaction Fee Mechanism: An Interdisciplinary Perspective," Papers 2305.02552, arXiv.org.
    3. Jason Milionis & Dean Hirsch & Andy Arditi & Pranav Garimidi, 2022. "A Framework for Single-Item NFT Auction Mechanism Design," Papers 2209.11293, arXiv.org.
    4. Meryem Essaidi & Matheus V. X. Ferreira & S. Matthew Weinberg, 2022. "Credible, Strategyproof, Optimal, and Bounded Expected-Round Single-Item Auctions for all Distributions," Papers 2205.14758, arXiv.org.
    5. Andrea Canidio, 2023. "Auctions with Tokens: Monetary Policy as a Mechanism Design Choice," Papers 2301.13794, arXiv.org, revised Aug 2023.
    6. Yulin Liu & Yuxuan Lu & Kartik Nayak & Fan Zhang & Luyao Zhang & Yinhong Zhao, 2022. "Empirical Analysis of EIP-1559: Transaction Fees, Waiting Time, and Consensus Security," Papers 2201.05574, arXiv.org, revised Apr 2023.
    7. Wenpin Tang & David D. Yao, 2023. "Transaction fee mechanism for Proof-of-Stake protocol," Papers 2308.13881, arXiv.org, revised Aug 2023.
    8. Yotam Gafni & Aviv Yaish, 2022. "Greedy Transaction Fee Mechanisms for (Non-)myopic Miners," Papers 2210.07793, arXiv.org, revised Feb 2024.
    9. Arve, Malin & Zwart, Gijsbert, 2023. "Optimal procurement and investment in new technologies under uncertainty," Journal of Economic Dynamics and Control, Elsevier, vol. 147(C).
    10. Yuya Wakabayashi & Ryosuke Sakai & Shigehiro Serizawa, 2022. "A Characterization of the Minimum Price Walrasian Rule with Reserve Prices for an Arbitrary Number of Agents and Objects," ISER Discussion Paper 1161, Institute of Social and Economic Research, Osaka University.
    11. Nicolas Gruyer, 2009. "Optimal Auctions When A Seller Is Bound To Sell To Collusive Bidders," Journal of Industrial Economics, Wiley Blackwell, vol. 57(4), pages 835-850, December.
    12. Laurent Lamy, 2013. "“Upping the ante”: how to design efficient auctions with entry?," RAND Journal of Economics, RAND Corporation, vol. 44(2), pages 194-214, June.
    13. Yeon-Koo Che & Ian Gale, 1994. "Auctions with budget-constrained buyers: a nonequivalence result," Working Papers (Old Series) 9402, Federal Reserve Bank of Cleveland.
    14. Scott Fay & Robert Zeithammer, 2017. "Bidding for Bidders? How the Format for Soliciting Supplier Participation in NYOP Auctions Impacts Channel Profit," Management Science, INFORMS, vol. 63(12), pages 4324-4344, December.
    15. Hanming Fang & Peter Norman, 2014. "Toward an efficiency rationale for the public provision of private goods," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 56(2), pages 375-408, June.
    16. Jeremy Bulow & Paul Klemperer, 1994. "Auctions vs. Negotiations," NBER Working Papers 4608, National Bureau of Economic Research, Inc.
    17. Bogetoft, Peter & Nielsen, Kurt, 2003. "Yardstick Based Procurement Design In Natural Resource Management," 2003 Annual Meeting, August 16-22, 2003, Durban, South Africa 25910, International Association of Agricultural Economists.
    18. Shunda, Nicholas, 2009. "Auctions with a buy price: The case of reference-dependent preferences," Games and Economic Behavior, Elsevier, vol. 67(2), pages 645-664, November.
    19. Koessler, Frédéric & Skreta, Vasiliki, 2016. "Informed seller with taste heterogeneity," Journal of Economic Theory, Elsevier, vol. 165(C), pages 456-471.
    20. Siao-Leu Phouratsamay & Safia Kedad-Sidhoum & Fanny Pascual, 2021. "Coordination of a two-level supply chain with contracts," 4OR, Springer, vol. 19(2), pages 235-264, June.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2402.09321. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.