Abstract

 


 



Time-Dependent Trading Strategies in a Continuous Double Auction


Shira Fano


Ca Foscari University of Venice - Department of Economics

Paolo Pellizzari


Ca Foscari University of Venice - Department of Economics

April 1, 2011

University Ca' Foscari of Venice, Department of Economics Research Paper No. 3

Abstract:     
We model a continuous double auction with heterogenous agents and compute approximate optimal trading strategies using evolution strategies. Agents privately know their values and costs and have a limited time to transact. We focus on equilibrium strategies that are developed taking into account the number of traders that submitted orders previously, as well as the number of who will submit subsequently. We find that it is optimal to place increasingly aggressive orders, according to a roughly linear schedule, and test the resulting equilibrium for robustness and accuracy.

Number of Pages in PDF File: 16

Keywords: Continuous double auction, equilibrium trading strategies, evolution strategies

JEL Classification: D53, D44, C61, C63

working papers series


Download This Paper

Date posted: May 17, 2011  

Suggested Citation

Fano, Shira and Pellizzari, Paolo, Time-Dependent Trading Strategies in a Continuous Double Auction (April 1, 2011). University Ca' Foscari of Venice, Department of Economics Research Paper No. 3. Available at SSRN: http://ssrn.com/abstract=1843305 or http://dx.doi.org/10.2139/ssrn.1843305

Contact Information

Shira Fano
Ca Foscari University of Venice - Department of Economics ( email )
Cannaregio 873
Venice, 30121
Italy
Paolo Pellizzari (Contact Author)
Ca Foscari University of Venice - Department of Economics ( email )
Cannaregio 873
Venice, 30121
Italy
Feedback to SSRN (Beta)


Paper statistics
Abstract Views: 309
Downloads: 40
People who downloaded this paper also downloaded:
1. How Does the Market React to Your Order Flow?
By Bence Toth, Zoltan Eisler, ...

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