loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Jarrod Trevathan and Wayne Read

Affiliation: School of Mathematical and Physical Sciences, James Cook University, Australia

ISBN: 978-972-8865-62-7

Keyword(s): Continuous double auctions, online auctions, share trading, competitive analysis.

Related Ontology Subjects/Areas/Topics: Communication and Software Infrastructure ; e-Business ; e-Commerce and e-Business: B2B and B2C ; e-Commerce Protocols and Micropayment Schemes ; Electronic Payment Systems and Exchange Protocols ; Enterprise Information Systems ; Enterprise Software Technologies ; Global Communication Information Systems and Services ; Information and Systems Security ; Online Auctions ; Software Engineering ; Telecommunications ; Web and Mobile Business Systems and Services ; Web Technologies and Web Services

Abstract: Market clearing is the process of matching buy and sell bids in securities markets. The allocative efficiency of such algorithms is important, as the Auctioneer is typically paid a commission on the number of bids matched and the volume of quantity traded. Previous algorithms have concentrated on price issues. This paper presents several market clearing algorithms that focus solely on allocating quantity among matching buy and sell bids. The goal is to maximise the number of bids matched, while at the same time minimise the amount of unmatched quantity. The algorithms attempt to avoid situations resulting in unmarketable quantities (i.e., quantities too small to sell). Algorithmic performance is tested using simulated data designed to emulate the Australian Stock Exchange (ASX) and other world stock markets. Our results show that it is difficult to avoid partial matchings as the complexity of doing so is NP-complete. The optimal offline algorithm for partial quantity matching is used as a benchmark to compare online matching strategies. We present three algorithms that outperform the ASX’s strategy by increasing the number of bids matched, the amount of quantity matched, and the number of bids fully matched. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.227.240.143

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Trevathan J.; Read W. and (2006). VARIABLE QUANTITY MARKET CLEARING ALGORITHMS.In Proceedings of the International Conference on e-Business - Volume 1: ICE-B, (ICETE 2006) ISBN 978-972-8865-62-7, pages 126-133. DOI: 10.5220/0001426901260133

@conference{ice-b06,
author={Jarrod Trevathan and Wayne Read},
title={VARIABLE QUANTITY MARKET CLEARING ALGORITHMS},
booktitle={Proceedings of the International Conference on e-Business - Volume 1: ICE-B, (ICETE 2006)},
year={2006},
pages={126-133},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001426901260133},
isbn={978-972-8865-62-7},
}

TY - CONF

JO - Proceedings of the International Conference on e-Business - Volume 1: ICE-B, (ICETE 2006)
TI - VARIABLE QUANTITY MARKET CLEARING ALGORITHMS
SN - 978-972-8865-62-7
AU - Trevathan, J.
AU - Read, W.
PY - 2006
SP - 126
EP - 133
DO - 10.5220/0001426901260133

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.