Maximizing matching in double-sided auctions

  • Authors:

  • Jinzhong Niu;Simon Parsons

  • Affiliations:

  • The City College, The City University of New York, New York, NY, USA;Brooklyn College, The City University of New York, Brooklyn, NY, USA

  • Venue:
  • Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Traditionally in double auctions, offers are cleared at the equilibrium price. In this paper, we introduce a novel, non-recursive, matching algorithm for double auctions, which aims to maximize the amount of commodities to be traded. Our algorithm has lower time and space complexities than existing algorithms.