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

Combinatorial Auctions without a Numeraire: The Case of Blockchain Trade-Intent Auctions

Author

Listed:
  • Andrea Canidio
  • Felix Henneke

Abstract

Blockchain trade intent auctions currently intermediate approximately USD 5 billion monthly. Due to production complementarities, the auction is combinatorial: when multiple trade intents from different traders are auctioned off simultaneously, a bidder (here called solver) can generate additional efficiencies by winning a batch of multiple trade intents. However, unlike other combinatorial auctions studied in the literature, the auction has no numeraire. Fairness is a concern as the efficiencies from batching cannot be easily shared between traders. We formalize this problem and study the most commonly used auction formats: batch auctions and multiple simultaneous auctions. We also propose a novel fair combinatorial auction that combines batch auction and multiple simultaneous auctions: solvers submit individual-trade bids and batched bids, but batched bids are considered only if they are better for all traders relative to the outcome of multiple simultaneous auctions (constructed using the individual-trade bids). We find a trade-off between the fairness guarantees provided by the auction (i.e., the minimum each trader can expect to receive) and the expected value of the assets returned to the traders. Also, the amount that each trader receives in the equilibrium of the fair combinatorial auction may be higher or lower than what they receive in the equilibrium of the simultaneous auctions used as a benchmark for fairness.

Suggested Citation

  • Andrea Canidio & Felix Henneke, 2024. "Combinatorial Auctions without a Numeraire: The Case of Blockchain Trade-Intent Auctions," Papers 2408.12225, arXiv.org.
  • Handle: RePEc:arx:papers:2408.12225
    as

    Download full text from publisher

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

    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:2408.12225. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.