Computer Science – Computer Science and Game Theory
Scientific paper
2011-10-07
Computer Science
Computer Science and Game Theory
18 pages
Scientific paper
This manuscript investigates the relationship between Blackwell Approachability, a stochastic vector-valued repeated game, and minimax theory, a single-play scalar-valued scenario. First, it is established in a general setting --- one not permitting invocation of minimax theory --- that Blackwell's Approachability Theorem and its generalization due to Hou are still valid. Second, minimax structure grants a result in the spirit of Blackwell's weak-approachability conjecture, later resolved by Vieille, that any set is either approachable by one player, or avoidable by the opponent. This analysis also reveals a strategy for the opponent.
No associations
LandOfFree
Blackwell Approachability and Minimax Theory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Blackwell Approachability and Minimax Theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Blackwell Approachability and Minimax Theory will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-133067