"Incremental Methods for Simple
Problems in Time Series: Algorithms and Experiments"
Xiaojian Zhao, Xin Zhang, Tyler Neylon, Dennis Shasha:
IDEAS 2005: pp. 3 - 14
Shared Information in Game Theory
Some results concerning what advantages
may be achieved by cooperating or otherwise sharing
some information in some two-player games
(relatively informal style).
Some thoughts on
entropy as a compression bound
Mainly, a product integral based proof of a key
inequality in proving that entropy is the best possible
compression rate over a given
discrete probability distribution of an alphabet.
Some easy bounds
Another nice example of using the product integral
to derive a useful inequality.