Game Trees are a way for players to make decisions in a sequence based on the choices of the other player. The tree is organized as shown below:
The nodes represent the different players, the branches leading down from the nodes show the choice of the players, and the numbers located at the bottom are the payoffs of the game.
Example: In this example covered in the homework, Colin and Rose are attempting to decide where they are going on a date. Colin gets the choose what they do between the choices of dancing, dinner or movies. Rose then gets the make the choice on the specifics (each listed with the preference of each of the players). In this scenario, Rose has the power because even though Colin gets the make the decision of what they are doing Rose still gets to select the option she wants the most. In this particular movie, the payoff to Rose was 6 as the best choice of Colin was the movies but Rose chose Love Actually. Love Actually’s payout at the bottom of the tree is (6,-4).
Why I liked this game: I found this game to be interesting because it showed how a game can seem fair when in reality one side has a clear advantage. That concept is important moving forward in understanding game theory, even outside the realm of game trees.
Game Portfolio 