On-line difference maximization

SIAM Journal on Discrete Mathematics

Volumn 12, Issue 1, 1999, Pages 78-90

  Kao, Ming Yang ^a   Tate, Stephen R ^b  

^a Yale University   (United States)

^b UNIVERSITY OF NORTH TEXAS   (United States)

Author keywords

Analysis of algorithms; Financial games; On line algorithms; Secretary problem

Indexed keywords

EID: 0004540699     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480196307445     Document Type: Article

References (20)

1. M. AJTAI, N. MEGIDDO, AND O. WAARTS, Improved algorithms and analysis for secretary problems and generalizations, in Proc. 36th Symposium on Foundations of Computer Science, 1995, pp. 473-482.
2. G. J. ALEXANDER AND W. F. SHARPE, Fundamentals of Investments, Prentice-Hall, Englewood Cliffs, NJ, 1989.
3. P. BILLINGSLEY, Probability and Measure, 2nd ed., John Wiley and Sons, New York, 1986.
4. A. CHOU, J. COOPERSTOCK, R. EL-YANIV, M. KLUGERMAN, AND T. LEIGHTON, The statistical adversary allows optimal money-making trading strategies, in Proc. 6th Annual ACM-SIAM Symposium on Discrete Algorithms, 1995, pp. 467-476.
5. Y. CHOW, H. ROBBINS, AND D. SIEGMUND, Great Expectations: The Theory of Optimal Stopping, Houghton Mifflin, Boston, 1971.
6. Y. S. CHOW, S. MORIGUTI, H. ROBBINS, AND S. M. SAMUELS, Optimal selection based on relative rank (the "secretary problem"), Israel J. Math., 2 (1964), pp. 81-90.
7. T. M. COVER, An algorithm for maximizing expected log investment return, IEEE Trans. Inform. Theory, IT-30 (1984), pp. 369-373.
8. R. EL-YANIV, A. FIAT, R. KARP, AND G. TURPIN, Competitive analysis of financial games, in Proc. 33rd Symposium on Foundations of Computer Science, 1992, pp. 327-333.
9. E. F. FAMA, Foundations of Finance, Basic Books, New York, 1976.
10. P. R. FREEMAN, The secretary problem and its extensions: A review, Internat. Statist. Rev., 51 (1983), pp. 189-206.
11. M. GARDNER, Mathematical games, Sci. Amer., 202 (1960), pp. 150-153.
12. A. R. KARLIN, M. S. MANASSE, L. RUDOLPH, AND D. D. SLEATOR, Competitive snoopy caching, in Proc. 27th Symposium on Foundations of Computer Science, 1986, pp. 244-254.
13. D. E. KNUTH, The Art of Computer Programming, Volume 1: Seminumerical Algorithms, 2nd ed., Addison-Wesley, Reading, MA, 1981.
14. A. MUCCI, Differential equations and optimal choice problems, Ann. Statist., 1 (1973), pp. 104-113.
15. W. T. RASMUSSEN AND S. R. PLISKA, Choosing the maximum from a sequence with a discount function, Appl. Math. Optim., 2 (1976), pp. 279-289.
16. D. D. SLEATOR AND R. E. TARJAN, Amortized efficiency of list update and paging rules, Comm. ACM, 28 (1985), pp. 202-208.
17. M. H. SMITH AND J. J. DEELY, A secretary problem with finite memory, J. Amer. Statist. Assoc., 70 (1975), pp. 357-361.
18. M. TAMAKI, Recognizing both the maximum and the second maximum of a sequence, J. Appl. Probab., 16 (1979), pp. 803-812.
19. P. WHITTLE, Optimization Over Time: Dynamic Programming and Stochastic Control: Volume 1, John Wiley and Sons, Chichester, 1982.
20. P. WILMOTT, S. HOWISON, AND J. DEWYNNE, The Mathematics of Financial Derivatives, Cambridge University Press, Cambridge, UK, 1995.