Citation :
Wadge game
The Wadge game is a simple infinite game discovered by William Wadge (pronounced "wage" ). It is used to investigate the notion of continuous reduction for subsets of Baire space. Wadge had analyzed the structure of the Wadge hierarchy for Baire space with games by 1972, but published these results only much later in his PhD thesis. In the Wadge game G(A,B), player I and player II each in turn play integers which may depend on those played before. The outcome of the game is determined by checking whether the sequences x and y generated by players I and II are contained in the sets A and B, respectively. Player II wins if the outcome is the same for both players, i.e.
x\in A\Leftrightarrow y\in B
Player I wins if the outcome is different. Sometimes this is also called the Lipschitz game, and the variant where player II has the option to pass (but has to play infinitely often) is called the Wadge game.
Suppose for a moment that the game is determined. If player I has a winning strategy, then this defines a continuous (even Lipschitz) map reducing B to the complement of A, and if on the other hand player II has a winning strategy then you have a reduction of A to B. For example, suppose that player II has a winning strategy. Map every sequence x to the sequence y that player II plays in G(A,B) if player I plays the sequence x, where player II follows his or her winning strategy. This defines a is a continuous map f with the property that x is in A if and only if f(x) is in B.
|