Online two-way trading: randomization and advice
From MaRDI portal
Publication:2219058
DOI10.1016/j.tcs.2020.12.016zbMath1479.91373OpenAlexW3112854149MaRDI QIDQ2219058
Publication date: 19 January 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.12.016
Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27) Financial markets (91G15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal algorithms for online time series search and one-way trading with interrelated prices
- Online computation with advice
- Optimal algorithms for \(k\)-search with application in option pricing
- An improvement on El-Yaniv-Fiat-Karp-Turpin's money-making bi-directional trading strategy
- Competitive analysis of bi-directional non-preemptive conversion
- On the advice complexity of the \(k\)-server problem
- The online knapsack problem: advice and randomization
- Optimal Buy-and-Hold Strategies for Financial Markets with Bounded Daily Returns
- Advice Complexity of the Online Search Problem
- On the Advice Complexity of Online Problems
- Optimal online algorithms for the portfolio selection problem, bi-directional trading and -search with interrelated prices
- Measuring the problem-relevant information in input
- Optimal online two-way trading with bounded number of transactions
- Optimal search and one-way trading online algorithms
