extensive form game

A game in extensive form is one that can be represented as a tree, where each node corresponds to a choice by one of the players. Unlike a normal form game, in an extensive form game players make choices sequentially. However players do not necessarily always know which node they are at (that is, what moves have already been made).

Formally, an extensive form game is a set of nodes together with a function for each non-terminal node. The function specifies which player moves at that node, what actions are available, and which node comes next for each action. For each terminal node, there is instead a function defining utilities for each player when that node is the one the game results in. Finally the nodes are partitioned into information sets, where any two nodes in the same information set must have the same actions and the same moving player.

A pure strategy for each player is a function which, for each information set, selects one of the available actions. That is, if player $i$ ’s information sets are $h_{1},h_{2},\\ldots,h_{m}$ with corresponding sets actions $a_{1},a_{2},\\ldots,a_{m}$ then $S_{i}=\\prod_{x}h_{x}\\rightarrow\\prod_{x}a_{x}$ .

单词	ExtensiveFormGame
释义	extensive form game A game in extensive form is one that can be represented as a tree, where each node corresponds to a choice by one of the players. Unlike a normal form game, in an extensive form game players make choices sequentially. However players do not necessarily always know which node they are at (that is, what moves have already been made). Formally, an extensive form game is a set of nodes together with a function for each non-terminal node. The function specifies which player moves at that node, what actions are available, and which node comes next for each action. For each terminal node, there is instead a function defining utilities for each player when that node is the one the game results in. Finally the nodes are partitioned into information sets, where any two nodes in the same information set must have the same actions and the same moving player. A pure strategy for each player is a function which, for each information set, selects one of the available actions. That is, if player $i$ ’s information sets are $h_{1},h_{2},\\ldots,h_{m}$ with corresponding sets actions $a_{1},a_{2},\\ldots,a_{m}$ then $S_{i}=\\prod_{x}h_{x}\\rightarrow\\prod_{x}a_{x}$ .
随便看	KingmansSubadditiveErgodicTheorem Kingman’s subadditive ergodic theorem Kite kite KKMLemma KKM lemma KleeneAlgebra Kleene algebra Kleene algebra KleeneAlgebra1 KleeneStar Kleene star KleeneStarOfAnAutomaton Kleene star of an automaton KleenesTheorem Kleene’s theorem Klein4group Klein 4-group Klein4ring Klein 4-ring KleinBottle Klein bottle KleinGordonEquation Klein-Gordon equation KloostermanSum