Abstract
The approachability theorem of Blackwell (1956b) is extended to infinite dimensional spaces. Two players play a sequential game whose payoffs are random variables. A set C of random variables is said to be approachable by player 1 if he has a strategy that ensures that the difference between the average payoff and its closest point in C, almost surely converges to zero. Necessary conditions for a set to be approachable are presented.
Original language | English |
---|---|
Pages (from-to) | 253-268 |
Number of pages | 16 |
Journal | International Journal of Game Theory |
Volume | 31 |
Issue number | 2 |
DOIs | |
State | Published - 2002 |