IDEAS home Printed from https://ideas.repec.org/a/wly/jfutmk/v35y2015i6p522-541.html
   My bibliography  Save this article

Time Pro‐rata Matching: Evidence of a Change in LIFFE STIR Futures

Author

Listed:
  • Angelo Aspris
  • Sean Foley
  • Drew Harris
  • Peter O'Neill

Abstract

Matching algorithms are important for well‐functioning financial markets. This paper examines the 2007 change by LIFFE, to move from pure pro‐rata to time pro‐rata allocation for the Euribor, Short Sterling, and Euroswiss futures contracts. We show that the removal of pure pro‐rata matching reduces market depth but suggest that this outcome improves execution quality for market participants. Our results are consistent with suggestions in the literature that the former regime creates incentives for traders to “drown” the order book with large orders and that the addition of a time element to this algorithm alters their behavior. We provide evidence that traders increase the amount of order splitting in the new framework, consistent with local optimizing, but argue that this may hinder overall market efficiency. © 2015 Wiley Periodicals, Inc. Jrl Fut Mark 35:522–541, 2015

Suggested Citation

  • Angelo Aspris & Sean Foley & Drew Harris & Peter O'Neill, 2015. "Time Pro‐rata Matching: Evidence of a Change in LIFFE STIR Futures," Journal of Futures Markets, John Wiley & Sons, Ltd., vol. 35(6), pages 522-541, June.
    • Handle: RePEc:wly:jfutmk:v:35:y:2015:i:6:p:522-541
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Vasilios Mavroudis, 2019. "Market Manipulation as a Security Problem," Papers 1903.12458, arXiv.org.
    2. Haynes, Richard & Onur, Esen, 2020. "Precedence rules in matching algorithms," Journal of Commodity Markets, Elsevier, vol. 19(C).
    3. Gil Hersch, 2023. "Procedural Fairness in Exchange Matching Systems," Journal of Business Ethics, Springer, vol. 188(2), pages 367-377, November.
    4. Foley, Sean & Krekel, William & Mollica, Vito & Svec, Jiri, 2023. "Not so fast: Identifying and remediating slow and imprecise cryptocurrency exchange data," Finance Research Letters, Elsevier, vol. 51(C).
    5. Khairul Zharif Zaharudin & Martin R. Young & Wei‐Huei Hsu, 2022. "High‐frequency trading: Definition, implications, and controversies," Journal of Economic Surveys, Wiley Blackwell, vol. 36(1), pages 75-107, February.

    More about this item

    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:wly:jfutmk:v:35:y:2015:i:6:p:522-541. 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: Wiley Content Delivery (email available below). General contact details of provider: http://www.interscience.wiley.com/jpages/0270-7314/ .

    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.