21 - 23 June 2010, Royal Holloway, University of London, Egham, Surrey, UK
Participation is by invitation. Please contact Glenn Shafer or Vladimir Vovk if you would like to participate. There is no registration fee. The workshop will provide lunches and the conference dinner on Tuesday, but participants will pay for their own accommodation, breakfasts, and dinners (except on Tuesday).
For accommodation and other local information, please click here.
For the programme and slides for many of the talks, please click here.
Local Organization: Computer Learning Research Centre, Department of Computer Science, Royal Holloway, University of London.
This workshop will bring together researchers studying game-theoretic probability with others who have also been studying topics and frameworks that do not assume or require a fully probabilized framework. These topics include imprecise probabilities (which in turn include Walley's upper and lower previsions and Dempster-Shafer theory), prequential statistics, on-line prediction (including prediction with expert advice, well-calibrated prediction, and defensive forecasting), and algorithmic randomness. Previous workshops with the same title, Game-Theoretic Probability and Related Topics, were held in 2006 and 2008 in Tokyo.
The objective of the workshop will be to make researchers in each of the different fields more aware of related work and to help them take advantage of it. Many commonalities have not yet been exploited. The workshop is important because the fields are developing the next generation of methods for sequential prediction. It is timely because there is increasing awareness about advances in game-theoretic probability and an increasing interest in using it as a general framework for communication among the different fields.
What is game-theoretic probability? Like the better known measure-theoretic framework, the game-theoretic framework for probability can be traced back to the 1654 correspondence between Blaise Pascal and Pierre Fermat, often said to be the origin of mathematical probability. In their correspondence, Pascal and Fermat explained their different methods for solving probability problems. Fermat's combinatorial method is a precursor of the measure-theoretic framework, now almost universally accepted by mathematicians as the result of work by Borel, Kolmogorov, Doob, Martin-Lof, and others. Pascal's method of backward recursion, using prices at each step in a game to derive global prices, can be seen as the precursor of the game-theoretic framework, to which von Mises, Ville, Kolmogorov, Schnorr, and Dawid contributed further ingredients.
The game-theoretic framework was presented in a comprehensive way, as an alternative to the measure-theoretic framework, by Shafer and Vovk in 2001 and Takeuchi in 2004 (see www.probabilityandfinance.com). As these authors explain, a classical probability theorem tells us that some event is very likely or even certain to happen. In the measure-theoretic framework, such a theorem becomes a statement about the measure of a set: the set has measure near or equal to one. In the game-theoretic framework, it is instead a statement about a game: a player has a strategy that multiplies the capital it risks by a large or infinite factor if the event fails to happen. The mere fact that we can translate theorems from measure theory into game theory in this way is of limited interest, but the translation opens up new ways of using probability theory and provides new insights into the meaning of probability and into many existing applications and related fields.
Some of the new insights come from the greater generality of the game-theoretic picture. Many classical theorems hold in generalized form even in games where relatively few payoffs are priced. In classical probability, all payoffs are priced (we call them random variables, and we call their prices expected values). This is not necessary in the game-theoretic picture. An investor in a financial market, for example, plays a game in which he can buy some payoffs (corresponding to various securities traded in the market) but not others. Because probabilities (or upper and lower probabilities) for global events are defined even in these situations, we see these probabilities as features that emerge from the structure of the game, not as features of objective reality or subjective belief external to the game.
One of the most active recent topics in game-theoretic probability, not adequately treated in the monographs by Shafer, Vovk, and Takeuchi, is continuous-time processes. The mathematical idea underlying recent work has been described by Takeuchi as high-frequency limit order trading. A player divides his capital among many different strategies, all of which rebalance a portfolio of bets when a continuous function reaches various discrete levels, but some of which operate at a much higher frequency than others. Various classical properties of stochastic processes emerge merely from the basic assumption that a strategy will not multiply the capital it risks by a very large factor.
The related topics that are represented in this workshop can be divided into four categories: (1) imprecise probabilities, (2) prequential statistics, (3) on-line prediction, and (4) algorithmic randomness.
This list reproduces some of the links given above and gives some new ones: