What is a subgame in game theory?

In game theory, a subgame is any part (a subset) of a game that meets the following criteria (the following terms allude to a game described in extensive form): It has a single initial node that is the only member of that node’s information set (i.e. the initial node is in a singleton information set).

What is the difference between Nash equilibrium and Subgame perfect?

The key difference between subgame perfect equilibrium and Nash equilibrium is that subgame perfect equilibrium require that all threats are credible. Consequently, the study of subgame perfect equilibrium is the study of credible threats. Subgame perfect equilibria are a subset of Nash equilibria.

What is SPNE strategy?

Definition: A strategy profile for an extensive-form game is a subgame perfect Nash equilibrium (SPNE) if it spec- ifies a Nash equilibrium in each of its subgames.

How do you identify a subgame in game theory?

In order to find the subgame-perfect equilibrium, we must do a backwards induction, starting at the last move of the game, then proceed to the second to last move, and so on.

What are the subgame perfect equilibria of the Centipede game?

However, there is only one subgame perfect equilibrium (a popular refinement to the Nash equilibrium concept). In the unique subgame perfect equilibrium, each player chooses to defect at every opportunity. This, of course, means defection at the first stage.

What is the subgame perfect equilibrium quizlet?

A Nash equilibrium of an extensive form game is a subgame perfect equilibrium if it induces Nash equilibrium play in every subgame. Nash equilibria that do not involve any incredible threats or promises in any part of any player’s strategy are called subgame perfect.

How do you prove subgame perfect equilibrium?

The subgame-perfect Nash equilibrium is normally deduced by ‘backward induction’ from the various ultimate outcomes of the game, eliminating branches which would involve any player making a move that is not credible (because it is not optimal) from that node.

Is Nash equilibrium Pareto optimal?

It is found that Pareto optimal strategies are a subset of Nash Equilibrium strategies, and the former give the maximum payoff to all agents. Calculation of Pareto Optimal solutions incurs a lesser computational cost than that for Nash Equilibrium solutions.

How do you find the Subgame perfect equilibrium?

Finding subgame-perfect equilibria The subgame-perfect Nash equilibrium is normally deduced by “backward induction” from the various ultimate outcomes of the game, eliminating branches which would involve any player making a move that is not credible (because it is not optimal) from that node.

What is the Nash equilibrium in a centipede game?

There are a large number of Nash equilibria in a centipede game, but in each, the first player defects on the first round and the second player defects in the next round frequently enough to dissuade the first player from passing.