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 条
[11]  
Bachrach R, 1997, PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P53
[12]   EQUIPMENT REPLACEMENT POLICY [J].
BELLMAN, R .
JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1955, 3 (03) :133-136
[13]  
BENDAVID S, 1990, PROCEEDINGS OF THE TWENTY SECOND ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, P379, DOI 10.1145/100216.100268
[14]  
Blackwell D., 1956, PAC J MATH, V6, P1, DOI [DOI 10.2140/PJM.1956.6.1, 10.2140/pjm.1956.6.1]
[15]  
BLUM A, 1997, 10 ANN C COMP LEARN
[16]  
Bodie Zvi., 1993, INVESTMENTS
[17]   AN OPTIMAL ONLINE ALGORITHM FOR METRICAL TASK SYSTEM [J].
BORODIN, A ;
LINIAL, N ;
SAKS, ME .
JOURNAL OF THE ACM, 1992, 39 (04) :745-763
[18]  
CHOU A, 1995, IN PRESS POWER MAGNI
[19]  
CHOU A, 1994, THESIS MIT
[20]  
CHOU A, 1995, P 6 ANN ACM SIAM S D
123456