Competitive solutions for online financial problems

被引：42
作者：
El-Yaniv, R [1 ]
机构：
[1] Hebrew Univ Jerusalem, Inst Comp Sci, IL-91905 Jerusalem, Israel
来源：
ACM COMPUTING SURVEYS | 1998年 / 30卷 / 01期
关键词：
D O I：
10.1145/274440.274442
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
This article surveys results concerning online algorithms for solving problems related to the management of money and other assets. In particular, the survey focuses on search, replacement, and portfolio selection problems.
引用
收藏
页码：28 / 69
页数：42
相关论文
共 59 条
[31]   THE SECRETARY PROBLEM AND ITS EXTENSIONS - A REVIEW [J].
FREEMAN, PR .
INTERNATIONAL STATISTICAL REVIEW, 1983, 51 (02) :189-206
[32]   BOUNDS FOR CERTAIN MULTIPROCESSING ANOMALIES [J].
GRAHAM, RL .
BELL SYSTEM TECHNICAL JOURNAL, 1966, 45 (09) :1563-+
[33]  
HART S, 1997, 120 HEBR U JER
[34]  
Helmbold D. P., 1996, Machine Learning. Proceedings of the Thirteenth International Conference (ICML '96), P243
[35]  
HULL JOHN., 1993, OPTIONS FUTURES OTHE
[36]  
IRANI S, 1994, UNPUB PROBLEM RENTIN
[37]  
JAMSHIDIAN F., 1992, MATH FINANC, V2, P131, DOI [DOI 10.1111/mafi.1992.2.issue-2, https://doi.org/10.1111/j.1467-9965.1992.tb00042.x, DOI 10.1111/J.1467-9965.1992.TB00042.X]
[38]  
Johnson D. S., 1974, SIAM Journal on Computing, V3, P299, DOI 10.1137/0203025
[39]  
KARP RM, 1993, COMMUNICATION
[40]  
Kuhn, 1953, Contributions to the Theory of Games, P193, DOI DOI 10.1515/9781400881970-012
123456