國(guó)外博弈論課件lecture(21)(已改無(wú)錯(cuò)字)
2022-11-19 13:59:01 本頁(yè)面
【正文】 ct it with its successors represent the actions available to the player represented by the node Player 1 Player 2 H T 1, 1 1, 1 H T Player 2 H T 1, 1 1, 1 June 4, 2021 73347 Game TheoryLecture 12 14 Game tree ? A path from the root to a terminal node represents a plete sequence of moves which determines the payoff at the terminal node Player 1 Player 2 H T 1, 1 1, 1 H T Player 2 H T 1, 1 1, 1 June 4, 2021 73347 Game TheoryLecture 12 15 Strategy ? A strategy for a player is a plete plan of actions. ? It specifies a feasible action for the player in every contingency in which the player might be called on to act. June 4, 2021 73347 Game TheoryLecture 12 16 Entry game ? Challenger’s strategies ? In ? Out ? Incumbent’s strategies ? Acmodate (if challenger plays In) ? Fight (if challenger plays In) ? Payoffs ? Normalform representation Incumbent Acmodate Fight Challenger In 2 , 1 0 , 0 Out 1 , 2 1 , 2 June 4, 2021 73347 Game TheoryLecture 12 17 Strategy and payoff ? In a game tree, a strategy for a player is represented by a set of edges. ? A bination of strategies (sets of edges), one for each player, induce one path from the root to a terminal node, which determines the payoffs of all players June 4, 2021 73347 Game TheoryLecture 12 18 Sequentialmove matching pennies ? Player 1’s strategies ? Head ? Tail ? Player 2’s strategies ? H if player 1 plays H, H if player 1 plays T ? H if player 1 plays H, T if player 1 plays T ? T if player 1 plays H, H if player 1 plays T ? T if
教學(xué)課件相關(guān)推薦
鄂ICP備17016276號(hào)-1