Optimal algorithms for online time series search and one-way trading with interrelated prices
- 3 August 2010
- journal article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 23 (2) , 159-166
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Average-case competitive analyses for one-way tradingJournal of Combinatorial Optimization, 2009
- Optimal Algorithms for k-Search with Application in Option PricingAlgorithmica, 2008
- Online auctions and generalized secretary problemsACM SIGecom Exchanges, 2008
- Online Search with Time-Varying Price BoundsAlgorithmica, 2007
- Optimal stopping problems by two or more decision makers: a surveyComputational Management Science, 2006
- Competitive algorithms for VWAP and limit order trading2004
- Optimal Search and One-Way Trading Online AlgorithmsAlgorithmica, 2001
- Who Solved the Secretary Problem?Statistical Science, 1989
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985
- Optimal Stopping with Sampling Cost: The Secretary ProblemThe Annals of Probability, 1981