ACM Home Page
Please provide us with feedback. Feedback
Competitive algorithms for VWAP and limit order trading
Full text PdfPdf (222 KB)
Source Electronic Commerce archive
Proceedings of the 5th ACM conference on Electronic commerce table of contents
New York, NY, USA
SESSION: Session 7 table of contents
Pages: 189 - 198  
Year of Publication: 2004
ISBN:1-58113-711-0
Authors
Sham M. Kakade  University of Pennsylvania
Michael Kearns  University of Pennsylvania
Yishay Mansour  Tel Aviv University
Luis E. Ortiz  University of Pennsylvania
Sponsors
ACM: Association for Computing Machinery
SIGEcom: ACM Special Interest Group on Electronic Commerce
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 66,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/988772.988801
What is a DOI?

ABSTRACT

We introduce new online models for two important aspectsof modern financial markets: Volume Weighted Average Pricetrading and limit order books. We provide an extensivestudy of competitive algorithms in these models and relatethem to earlier online algorithms for stock trading.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
R. El-Yaniv, A. Fiat, R. M. Karp, and G. Turpin. Optimal search and one-way trading online algorithms. Algorithmica, 30:101--139, 2001.
 
4
M. Kearns and L. Ortiz. The Penn-Lehman automated trading project. IEEE Intelligent Systems, 2003. To appear.


Collaborative Colleagues:
Sham M. Kakade: colleagues
Michael Kearns: colleagues
Yishay Mansour: colleagues
Luis E. Ortiz: colleagues