Competitive solutions for online financial problems

ACM Computing Surveys

Volumn 30, Issue 1, 1998, Pages 28-69

  El Yaniv, Ran ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

F.1.2 computation by abstract devices : Modes of computation Online computation, probabilistic computation; F.2.2 analysis of algorithms and problem complexity : Nonnumerical algorithms and problems Sorting and searching

Indexed keywords

ALGORITHMS; DECISION THEORY; FINANCE; INSURANCE; OPERATIONS RESEARCH; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES; COMPUTATIONAL COMPLEXITY; COMPUTER APPLICATIONS; ONLINE SYSTEMS; PROBABILITY;

MATHEMATICAL THEORY; PROFIT FUNCTIONS; DISCRETE MATHEMATICS;

ONLINE SYSTEMS; FINANCIAL DATA PROCESSING;

EID: 0032010321     PISSN: 03600300     EISSN: None     Source Type: Journal    
DOI: 10.1145/274440.274442     Document Type: Article

References (61)

1. AJTAI, M., MEGIDDO, N., AND WAARTS, O. 1995. Improved algorithms and analysis for secretary problems and generalizations. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 473-482.
2. AL BINALI, S. 1997. The competitive analysis of risk taking with application to online trading. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science.
3. AUER, P., CESA-BIANCHI, N., FREUND, Y., AND SCHAPIRE, R. E. 1995. Gambling in a rigged casino: The adversarial multi-armed bandit problem. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 322-331.
4. AWERBUCH, B., AZAR, Y., FIAT, A., AND LEIGHTON, T. 1996. Making commitments in the face of uncertainty: How to pick a winner almost every time. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing.
5. AZAR, Y., BARTAL, Y., FEUERSTEIN, E., FIAT, A., LEONARDI, S., AND ROSEN, A. 1996. On capital investment. In Proceedings of the 23rd ICALP, 429-441.
6. BACHRACH, R. AND EL-YANIV, R. 1997. Online list accessing algorithms and their applications: Recent empirical evidence. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, 53-62.
7. BELLMAN, R. 1955. Equipment replacement policy. J. Soc. Ind. Appl. Math. 3, 133-136.
8. BEN-DAVID, S., BORODIN, A., KARP, R., TARDOS, G., AND WIDGERSON, A. 1990. On the power of randomization in on-line algorithms. In Proceedings of the 22nd Symposium on Theory of Algorithms, 379-386. Also in Algorithmica 11 (1994), 2-14.
9. BEN-DAVID, S., BORODIN, A., KARP, R., TARDOS, G., AND WIDGERSON, A. 1990. On the power of randomization in on-line algorithms. In Proceedings of the 22nd Symposium on Theory of Algorithms, 379-386. Also in Algorithmica 11 (1994), 2-14.
10. BLACKWELL, D. 1956. An analog of the minimax theorem for vector payoffs. Pacific J. Math. 6, 1-8.
11. BLUM, A. AND KALAI, A. 1997. Universal portfolios with and without transaction costs. In Tenth Annual Conference on Computational Learning Theory.
12. BODIE, Z., KANE, A., AND MARCUS, A. J. 1993. Investments. Irwin.
13. BORODIN, A., LINIAL, N., AND SAKS, M. 1992. An optimal online algorithm for metrical task systems. J. ACM 39, 745-763.
14. BREIMAN, L. 1961. Optimal gambling systems for favorable games. In Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability, Vol. 1. University of California Press, Berkeley, 65-78.
15. CHOU, A. 1994. Optimal trading strategies vs. a statistical adversary. Master's Thesis, Massachusetts Institute of Technology.
16. CHOU, A., COOPERSTOCK, J., EL-YANIV, R., KLUGERMAN, M., AND LEIGHTON, T. 1995a. The statistical adversary allows optimal money-making trading strategies. In Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms.
17. CHOU, A., SHRIVASTAVA, A., AND SIDNEY, R. 1995b. On the power of magnitude. (To be published).
18. CHOW, Y. S., ROBBINS, H., AND SIEGMUND, D. 1971. The Theory of Optimal Stopping. Dover Publications.
19. COVER, T. M. 1991. Universal portfolios. Math. Finance 1, 1 (Jan.), 1-29.
20. COVER, T. M. AND GLUSS, D. H. 1986. Empirical Bayes stock market portfolios. Adv. Appl. Math. 7, 170-181.
21. COVER, T. M. AND ORDENTLICH, E. 1996. Universal portfolios with side information. IEEE Trans. Inf. Theor. (March).
22. COVER, T. M. AND THOMAS, J. A. 1991. Elements of Information Theory. John Wiley, New York.
23. COX, J. AND RUBINSTEIN, M. 1985. Options Markets. Prentice-Hall, Englewood Cliffs, NJ.
24. DERMAN, C. 1963. On optimal replacement rules when changes of the state are Markovian. In Mathematical Optimization Techniques, R. Bellman, Ed.
25. EL-YANIV, R. 1996. On the decision theoretic foundations of the competitive ratio. (To be published).
26. EL-YANIV, R., FIAT, A., KARP, R., AND TURPIN, G. 1992. Competitive analysis of financial games. In Proceedings of the 33rd Symposium on Foundations of Computer Science, 327-333.
27. EL-YANIV, R. AND KARP, R. M. 1997. Nearly optimal competitive online replacement policies. Math. Oper. Res. 22, 4, 814-839.
28. EL-YANIV, R., KANIEL, R., AND LINIAL, N. 1993. On the equipment rental problem. (To be published).
29. FREEMAN, P. R. 1983. The secretary problem and its extensions. Int. Stat. Rev. 51, 189-206.
30. GRAHAM, R. L. 1966. Bounds for certain multi-processor anomalies. Bell Syst. Tech. J. 45, 1563-1581.
31. HART, S. AND MAS-COLELL, A. 1997. A simple adaptive procedure leading to correlated equilibrium. The Hebrew University of Jerusalem. Discussion paper 120. Jan.
32. HELMBOLD, D. P., SCHAPIRE, R. E., SINGER, Y., AND WARMUTH, M. K. 1996. On-line portfolio selection using multiplicative updates. In Machine Learning: Proceedings of the 13th International Conference, 243-251.
33. HULL, J. 1993. Options, Futures, and Other Derivative Securities. Prentice-Hall, Englewood Cliffs, NJ.
34. IRANI, S. AND RAMANATHAN, D. 1994. The problem of renting versus buying. (Unpublished manuscript).
35. JAMSHIDIAN, F. 1992. Asymptotically optimal portfolios. Math. Fin. 2, 2, 131-150.
36. JOHNSON, D. S. 1973. Near-Optimal Bin Packing Algorithms. Ph.D. Thesis, Massachusetts Institute of Technology.
37. JOHNSON, D. S., DEMERS, A., ULLMAN, J. D., GAREY, M. R., AND GRAHAM, R. L. 1974. Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput. 3, 299-325.
38. KARLIN, A. R., MANASSE, M. S., RUDOLPH, L., AND SLEATOR, D. D. 1988. Competitive snoopy caching. Algorithmica 3, 1, 70-119.
39. KARP, R. M., OSTROVSKI, R., AND RABANI, Y. 1993. Personal communication.
40. KUHN, H. W. 1953. Extensive games and the problem of information. In Contribution to the Theory of Games, Vol. II, H. W. Kuhn and A. W. Tucker, Eds., Princeton University Press, Princeton, NJ, 193-216.
41. LEVHARI, D. AND MIRMAN, L. J. 1977. Saving and uncertainty with an uncertain horizon. J. Political Econ. 85, 265-281.
42. LEVIN, L. 1994. Personal communication, July.
43. LIPPMAN, S. A. AND MCCALL, J. J. 1976. The economics of job search: A survey. Econ. Inquiry (June), 155-189.
44. LIPPMAN, S. A. AND MCCALL, J. J. 1981. The economics of uncertainty: Selected topics and probabilistic methods. In Handbook of Mathematical Economics, Vol. 1, K. J. Arrow and M. D. Intriligator, Eds. Chapter 6, North-Holland, 211-284.
45. MACCRIMMON, K. R. AND WEHRUNG, D. A. 1986. Taking Risks: The Management of Uncertainty. The Free Press.
46. MERTON, R. C. 1981. On the microeconomic theory of investment under uncertainty. In Handbook of Mathematical Economics, Vol. 2, K. J. Arrow and M. D. Intriligator, Eds., Chapter 13, North-Holland, 601-669.
47. MIRMAN, L. J. 1971. Uncertainty and optimal consumption decisions. Econometrica 39, 179-185.
48. ORDENTLICH, E. AND COVER, T. M. 1996. On-line portfolio selection. In Proceedings of COLT 96. (To appear in Math. Oper. Res.).
49. ORDENTLICH, E. AND COVER, T. M. 1996. On-line portfolio selection. In Proceedings of COLT 96. (To appear in Math. Oper. Res.).
50. RAGHAVAN, P. 1992. A statistical adversary for on-line algorithms. DIMACS Series in Discrete Math. Theor. Comput. Sci. 7, 79-83.
51. ROSENFIELD, D. B. AND SHAPIRO, R. D. 1981. Optimal price search with Bayesian extensions. J. Econ. Theor.
52. ROTHSCHILD, M. AND STIGLITZ, J. E. 1970. Increasing risk I: A definition. J. Econ. Theor. 82, 225-243.
53. ROTHSCHILD, M. AND STIGLITZ, J. E. 1971. Increasing risk II: Its economic consequences. J. Econ. Theor. 3, 66-84.
54. SCARF, H. E. 1963. A survey of analytic techniques in inventory theory. In Multistage Inventory Models and Techniques. H. E. Scarf, D. M. Gilford, and M. W. Shelly, Eds., Chapter 7, Stanford University Press, Stanford, CA, 185-225.
55. SHARPE, W. F. 1966. Mutual fund performance. J. Business (Jan.).
56. SHESHINSKI, E. AND WEISS, Y. 1993. Optimum pricing policy under stochastic inflation. In Optimal Pricing, Inflation and the Cost of Price Adjustment, E. Sheshinski and Y. Weiss, eds., The MIT Press, Cambridge, MA.
57. SHILLING, A. G. 1992. Market timing: Better than a buy-and-hold strategy. Finan. Anal. J. (March-April), 46-50.
58. SLEATOR, D. AND TARJAN, R. E. 1985. Amortized efficiency of list update and paging rules. Commun. ACM 28, 202-208.
59. STOKEY, N. L. AND LUCAS, R. E., JR. 1989. Recursive Methods in Economic Dynamics, Chapter 13, Harvard University Press, Cambridge, MA, 389-413.
60. VON NEUMANN, J. AND MORGENSTERN, O. 1944. Theory of Games and Economic Behavior. Princeton University Press, Princeton, NJ.
61. YAO, A. C. 1980. New algorithms for bin packing. J. ACM 27, 207-227.