Abstract

 
 

References (8)



 


 



Learning to Trade in an Unbalanced Market


Florian Hauser


University of Innsbruck

Marco LiCalzi


Dept. Management, Università Ca' Foscari Venezia

September 26, 2011

Department of Management, Università Ca' Foscari Venezia Working Paper No. 2/2011

Abstract:     
We study the evolution of trading strategies in double auctions as the size of the market gets larger. When the number of buyers and sellers is balanced, Fano et al. (2011) show that the choice of the order-clearing rule (simultaneous or asynchronous) steers the emergence of fundamentally different strategic behavior. We extend their work to unbalanced markets, confirming their main result as well as that allocative inefficiency tends to zero. On the other hand, we discover that convergence to the competitive outcome takes place only when the market is large and that the long side of the market is more effective at improving its disadvantaged terms of trade under asynchronous order-clearing.

Number of Pages in PDF File: 15

Keywords: Trading protocols, Market design, Allocative efficiency, Genetic Programming

JEL Classification: G10, D82, C63

working papers series


Download This Paper

Date posted: April 11, 2012  

Suggested Citation

Hauser, Florian and LiCalzi, Marco, Learning to Trade in an Unbalanced Market (September 26, 2011). Department of Management, Università Ca' Foscari Venezia Working Paper No. 2/2011. Available at SSRN: http://ssrn.com/abstract=2037865 or http://dx.doi.org/10.2139/ssrn.2037865

Contact Information

Florian Hauser
University of Innsbruck ( email )
Universitätsstraße 15
Innsbruck, Innsbruck 6020
Austria
Marco LiCalzi (Contact Author)
Dept. Management, Università Ca' Foscari Venezia ( email )
San Giobbe, Cannaregio 873
Venice, 30121
Italy
+39-0412346925 (Phone)
+39-0412347444 (Fax)
HOME PAGE: http://venus.unive.it/licalzi/
Feedback to SSRN (Beta)


Paper statistics
Abstract Views: 150
Downloads: 14
References:  8

© 2013 Social Science Electronic Publishing, Inc. All Rights Reserved.  FAQ   Terms of Use   Privacy Policy   Copyright
This page was processed by apollo6 in 0.422 seconds