D. P. Helmbold, N. Littlestone and P. M. Long.  Apple tasting and nearly
one-sided learning.  Proceedings of the 33rd Annual Symposium on the
Foundations of Computer Science, pages 493--502, 1992.  To appear
in Information and Computation.  Available on the web at
http://www.comp.nus.edu.sg/~plong/papers/apple.ps.

N. Littlestone and P. M. Long.  Online learning with linear loss
constraints.  {\em Proceedings of the Sixth Annual Conference on
Computational Learning Theory}, pages 412--421, 1993.  To appear in
Information and Computation (with D. P. Helmbold).  Available on the
web at http://www.comp.nus.edu.sg/~plong/papers/constraint.ps.

P. Auer and N. Cesa-Bianchi and Y. Freund and R. E. Schapire.
Gambling in a rigged casino: The adversarial multi-armed bandit problem.
Proceedings of the 36th Annual Symposium on the Foundations of Computer
Science, 1995.  

P. M. Long.  On-line evaluation and prediction using linear functions.
{\em Proceedings of the 1997 Conference on Computational Learning
Theory}, pages 21--31.  Available on the web at
http://www.comp.nus.edu.sg/~plong/papers/eval.ps.

N. Abe and P. M. Long.  Associative reinforcement learning using linear
probabilistic concepts.  Proceedings of the Sixteenth
International Conference on Machine Learning, pages 3--11, 1999.
http://www.comp.nus.edu.sg/~plong/papers/peval.ps.

C. Allenberg.  Individual sequence prediction -- upper bounds and an
application for complexity.  Proceeding of the Twelfth Annual Conference
on Computational Learning Theory, pages 233-242, 1999.