HAL-Polytechnique
Not a member yet
51406 research outputs found
Sort by
Zero-Sum Games with "Almost" Perfect Information
No full textInternational audienceThe present paper generalizes the concept of perfect information to games in which the players, while moving sequentially, remain uncertain about the actual payoff of the game because of an initial chance move. It is proved that the value of such games with "almost" perfect information can still be computed using backward induction in the game tree. The optimal behavioral strategies obtained by a dynamic procedure may, however, require randomization. A typical illustration of such games is poker
Escalier doublement impossible
No full textDouble impossible staircase (Escalier doublement impossible
