Maximizing Matching in Double-sided Auctions

Jinzhong Niu and Simon Parsons

Papers from arXiv.org

Abstract: In this paper, we introduce a novel, non-recursive, maximal matching algorithm for double auctions, which aims to maximize the amount of commodities to be traded. It differs from the usual equilibrium matching, which clears a market at the equilibrium price. We compare the two algorithms through experimental analyses, showing that the maximal matching algorithm is favored in scenarios where trading volume is a priority and that it may possibly improve allocative efficiency over equilibrium matching as well. A parameterized algorithm that incorporates both maximal matching and equilibrium matching as special cases is also presented to allow flexible control on how much to trade in a double auction.

Date: 2013-02
New Economics Papers: this item is included in nep-gth
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://arxiv.org/pdf/1304.3135 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:1304.3135

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().