E. Zermelo, uber eine Anwendung der Mengenlehre auf die Theorie des Schachpiels, in Proc. 5th Internat. Congr. Mathematicians, vol. 2, Cambridge, 1913, pp. 501--504.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... than a game form, the terminal states s 3 , s 4 and s 5 will be marked either as a win for player 1 or as a win for player 2 (they cannot both lose since we are dealing with determined games only) Consequently, one of the two players i will have a winning strategy in G ext by Zermelo s theorem [127, 19], and the strategic game G snf which captures this information will simply be the empty strategic game G = i . In terms of programs, the relationship between an extensive game and its strategic normal form is analogous to the relationship between the tree of execution sequences of a terminating ....

E. Zermelo. Uber eine Anwendung der Mengenlehre auf die Theorie des Schachspiels. In E. Hobson and A. Love, editors, Proceedings of the 5th Intl. Congress of Mathematicians, volume II, pages 501--504. Cambridge

....task, so giving a non game theoretic semantics such as neighborhood semantics can be seen (among other things) as a technique to establish determinacy. To prove determinacy directly using game theoretic techniques, one has a number of standard results at one s disposal, such as Zermelo s theorem [20] and the Gale Stewart theorem [10] Note first that Zermelo s result does not apply to GL games, since it states that finite games are determined, i.e. games where all runs are finite. Since we introduced infinite runs for iteration, Zermelo s theorem cannot be applied. As for the Gale Stewart ....

Ernst Zermelo. Uber eine Anwendung der Mengenlehre auf die Theorie des Schachspiels. In E. Hobson and A. Love, editors, Proceedings of the 5th Intl. Congress of Mathematicians, volume II, pages 501--504. Cambridge University Press, 1913.

....we have many random variables. We will now describe a method for solving a game tree representation of a decision problem using local computation (or dynamic programming) If each information set is a singleton, then we solve the game tree using the backward recursion method of dynamic programming [Zermelo 1913, Kuhn 1953] This technique is also called rollback method in decision tree literature. A decision tree can be thought of as a game tree in which each information set is a singleton subset. The backward recursion method of dynamic programming can be generalized to include nonsingleton ....

Zermelo, E. (1913), "Uber Eine Anwendung Der Mengenlehre Auf Die Theorie Des Schachspiels," Proceedings of the Fifth International Congress of Mathematics, Cambridge, UK, 2, 501-504.

....and hardware now available, it would probably take more time than the universe has left to complete the calculations. However, in principle it is possible to analyze it. And then we would find either that White or Black has a winning strategy, or that both players have a drawing strategy [19]. In fact it is mathematically provable, that for any game that is in our class of games, either one of the players has a winning strategy, or both players have a drawing strategy [4] We call this: the game is determined . The reasoning is as follows: Suppose that it is player I s turn to ....

E. Zermelo, Uber eine anwendung der Mengenlehre auf die Theorie des Schachspiels, in: E.W. Hobson and A.E.H. Love (editors), Proceedings of the Fifth International Congress of Mathematicians, Vol. II, p 501-504, Cambridge University Press, Cambridge, 1913.

....between # and #) and the result is a play of # . # won by the proponent. 5 Determinacy A classical theorem of Zermelo [27] (see also [11] asserts that if a game (of perfect information, between two players, in which every play is a win for exactly one player) is such that it always ends in a finite number of moves, then the game is determined in the sense that one of the players has a winning strategy. This theorem ....

Ernst Zermelo. Uber eine Anwendung der Mengenlehre auf die Theorie des Schachspiels. In Hobson and Love [17], pages 501--504. Received 27 August 1996. Revised 10 October 1996

....if the set of strategies available to an individual is 2 or 2 10,000 . The logical operations are the same. Thus it can be proved that chess is an inessential game , i.e. if one could do all the calculations there would be no reason to play chess as each side would have an optimal strategy (Zermelo,1912) 4 (3) The cooperative or coalitional form of a game The coalitional or cooperative form of a game is based on primitive concepts far different from the extensive or strategic forms. It is assumed, a priori that there is some largest amount or set of amounts that any coalition S, of players can ....

Zermelo, E. 1912. "Uber eine Anwendung der Mengenlehre auf die Theorie des Schachspiels", Proceedings of the Fifth International Congress of Mathematicians, Vol II, pp.501-504.

....of perfect information games can be stated in our framework. Theorem 4.1 Value(pi; pi) can be computed in polynomial space. Proof: Recall the well known theorem that, in a perfect information game (even with chance moves) there is a deterministic optimal strategy for each player [Ze13]. Such optimal strategies, and the resulting value of the game, can easily be computed in polynomial space, using the standard min max algorithm: The game tree is traversed depth first. We know the payoff at each leaf. Now, consider a node u for which all the children have been assigned a payoff. ....

E. Zermelo, " Uber eine Anwendung der Mengenlehre auf die Theorie des Schachspiels," Proceedings of the Fifth International Congress of Mathematicians II, E. W. Hobson and A. E. H. Love, editors, Cambridge University Press, Cambridge, 1913.

....strategies suffice for such games is the basis for the standard minimax algorithm (and its variants) used for games such as chess. In such games, called zero sum games, there are two players whose payoffs always sum to zero, so that one player wins precisely what the other loses. As shown by Zermelo [1913] , the strategies produced by the minimax algorithm are optimal in a very strong sense. Player i cannot do better than to play the resulting strategy if the other player is rational. Furthermore, she can publicly announce her intention to do so without adversely affecting her payoffs. A ....

E. Zermelo. Uber eine Anwendung der Mengenlehre auf die Theorie des Schachspiels. In Proceedings of the Fifth InternationalCongress of Mathematicians II, pages 501--504. Cambridge University Press, 1913.

....that maximizes his or her own payoffs. Under the assumption that this player will act rationally, the player in the preceding node in the game tree can now determine the optimal action for him or her. This backward induction process reduces to the standard minimax algorithm (originally due to Zermelo [ 1913 ] in the case of zero sum games. Unfortunately, in most real life games, the players do not have perfect information. It is clear that this simple process cannot work for imperfect information games. Here, the decision as to the optimal move must be done for the entire information set, rather ....

E. Zermelo. Uber eine Anwendung der Mengenlehre auf die Theorie des Schachspiels. In E. W. Hobson and A. E. H. Love, editors, Proceedings of the Fifth International Congress of Mathematicians II, pages 501--504. Cambridge University Press, 1913.

....as a solution method: Intuitively, backward induction computes optimal moves at each node of the tree, assuming that optimal moves at all of its descendants have already been computed. For games with perfect information, this idea is precisely the well known max min algorithm, due to Zermelo [40]. A game has perfect information if at each point in the game all players know the entire history of the game up to that point. Thus, chess is a game with perfect information while poker is not. In many situations to which game theory applies, the game tree is explicitly given; in such cases, it ....

E. Zermelo. Uber eine Anwendung der Mengenlehre auf die Theorie des Schachspiels. In E. W. Hobson and A. E. H. Love, editors, Proceedings of the Fifth International Congress of Mathematicians II, pages 501--504. Cambridge University Press, 1913.

No context found.

E. Zermelo, uber eine Anwendung der Mengenlehre auf die Theorie des Schachpiels, in Proc. 5th Internat. Congr. Mathematicians, vol. 2, Cambridge, 1913, pp. 501--504.

No context found.

E. Zermelo. Uber eine anwendung der mengenlehre auf die theorie des schachspiels. In E. W. Hobson and A. E. H. Love, editors, Proceedings of the Fifth International Congress of Mathematicians II, pages 501504. Cambridge University Press, 1913. 88

No context found.

E. Zermelo,  Uber eine Anwendung der Mengenlehre auf die Theorie des Schachpiels, in Proc. 5th Internat. Congr. Mathematics, vol. 2, Cambridge, 1913, pp. 501{ 504.

No context found.

E. Zermelo. "Uber eine Anwendung der Mengenlehre auf die Theorie des Schachspiels". In E.W. Hobson and A.E.H. Love, editors, Proc. 5th International Congress of Mathematicians II, 501-- 504, Cambridge University Press, Cambridge 1913. A Proof of Lemma 6. We treat our distributions D i as vectors where each entry corresponds to the probability of some pair (q; a).

No context found.

Zermelo, E. (1913) \Uber eine Anwendung der Mengenlehre auf die Theorie des Schachspiels," Proceedings Fifth International Congress of Mathematicians,2,501- 504.

No context found.

Zermelo, E. 1913. Uber eine anwendung der mengenlehre auf die theorie des schachspiels. In Proceedings of the Fifth International Congress of Mathematicians, volume II. Cambridge: Cambridge University Press. 34

No context found.

E. Zermelo. Uber eine Anwendung der Mengenlehre auf die Theorie des Schachspiels. In Proceedings of the Fifth International Congress of Mathematicians, volume 2, pages 501--504, Cambridge, 1913.

No context found.

E. Zermelo,  Uber eine Anwendung der Mengenlehre auf die Theorie des Schachspiels, Proc. 5th International Congress of Mathematicians, v.2, 501-504, Cambridge U. Press 1913.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC