Convergence of outcomes and evolution of strategic behavior in double auctions
Abstract
We study the emergence of strategic behavior in double auctions with an equal number n of buyers and sellers, under the distinct assumptions that orders are cleared simultaneously or asynchronously. The evolution of strategic behavior is modeled as a learning process driven by a genetic algorithm. We find that, as the size n of the market grows, allocative inefficiency tends to zero and performance converges to the competitive outcome, regardless of the order-clearing rule. The main result concerns the evolution of strategic behavior. Under simultaneous order-clearing, as n increases, only marginal traders learn to be price takers and make offers equal to their valuations/costs. Under asynchronous order-clearing, as n increases, all intramarginal traders learn to be price makers and make offers equal to the competitive equilibrium price. The nature of the order-clearing rule affects in a fundamental way what kind of strategic behavior we should expect to emerge.Download Info
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.Bibliographic Info
Paper provided by Department of Applied Mathematics, Università Ca' Foscari Venezia in its series Working Papers with number 196.
Download reference. The following formats are available: HTML
(with abstract),
plain text
(with abstract),
BibTeX,
RIS (EndNote, RefMan, ProCite),
ReDIF
Length: 27 pages
Date of creation: Feb 2010
Date of revision:
Publication status: Forthcoming in Journal of Evolutionary Economics
Handle: RePEc:vnm:wpaper:196
Contact details of provider:
Postal: Dorsoduro, 3825/E, 30123 Venezia
Phone: ++39 041 2346910-6911
Fax: ++ 39 041 5221756
Web page: http://www.dma.unive.it/
More information through EDIRC
For corrections or technical questions regarding this item, or to correct its listing, contact: (Marco LiCalzi).
Related research
Keywords: Trading protocols; asymptotic equivalence; learning; genetic algorithms.;Find related papers by JEL classification:
- D44 - Microeconomics - - Market Structure and Pricing - - - Auctions
- D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information
- C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques
- C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
This paper has been announced in the following NEP Reports:
- NEP-ALL-2010-04-17 (All new papers)
- NEP-CMP-2010-04-17 (Computational Economics)
References
No references listed on IDEASYou can help add them by filling out this form.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.Cited by:
- Florian Hauser & Marco LiCalzi, 2011. "Learning to trade in an unbalanced market," Working Papers 2, Department of Management, Università Ca' Foscari Venezia.
- Paolo Pellizzari, 2011. "Optimal trading in a limit order book using linear strategies," Working Papers 2011_16, Department of Economics, University of Venice "Ca' Foscari", revised Sep 2011.
Lists
This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.Statistics
Access and download statisticsCorrections
When requesting a correction, please mention this item's handle: RePEc:vnm:wpaper:196For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Marco LiCalzi).
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.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.

