i can’t uderstand the activation function in the perfect-information game definition given by the book i’m studying on. ================================================================================================ A (finite) perfect-information game (in extensive form) is a tuple G=(N, A, H, Z, χ, ρ, σ, u) where: N is a set of n players A is a (single) set of actions Z is a […]

Categories

## Perfect information game – action function

- Post author By Full Stack
- Post date November 20, 2020
- No Comments on Perfect information game – action function

- Tags ..., a, a1) = σ(h2, a2 ∈ A, a2) then h1 = h2 and a1 = a2 u = (u1, disjoint from H χ : H → 2^A is the action function, First, H, h2 ∈ H and a1, how the set of actions A is defined. In a normal form game it is the product A = (A1 x A2 x .... x An) where each Ai is the set of all possib, i can't uderstand the activation function in the perfect-information game definition given by the book i'm studying on. ====================, if σ(h1, u) where: N is a set of n players A is a (single) set of actions Z is a set of terminal nodes, un, where ui : Z → R is a real-valued utility function for player i on the terminal nodes Z ====================================================, which maps a choice node and an action to a new choice node or terminal node such that for all h1, wich assigns to each choice node a set of possible actions ρ : H → N is the player function, wich assigns to each non terminal node a player i ∈ N who chooses an action at that node σ : H x A is the successor function, z, ρ, σ, χ