Online -search problem and its competitive analysis
Authors:
- 1 August 2015
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 593, 139-145
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (71201123, 71172189)
- Program for New Century Excellent Talents in University (NCET-12-0824)
- Distinguished Young Professor Program (A201305)
- Fundamental Research Funds for the Central Universities (2232013D3-46)
This publication has 11 references indexed in Scilit:
- On Variants of the Matroid Secretary ProblemAlgorithmica, 2013
- Online algorithms for the multiple time series search problemComputers & Operations Research, 2012
- Optimal algorithms for the online time series search problemTheoretical Computer Science, 2011
- 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 Search and One-Way Trading Online AlgorithmsAlgorithmica, 2001
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985
- Optimal selection based on relative rank (the “secretary problem”)Israel Journal of Mathematics, 1964