Game Theory Problem With 100 Couples And Cheating

1. Game Theory Problem With 100 Couples And Cheating Stories
2. Game Theory Problem With 100 Couples And Cheating Together
3. Game Theory Problem With 100 Couples And Cheating Relationships
4. Game Theory Problem With 100 Couples And Cheating Couples

Hacks, repairs, arcade games, sci-fi, and some very bad ideas with possibly humorous consequences. The study of competitive and non-competitive games, equilibrium concepts such as Nash equilibrium, and related subjects. Combinatorial games such as Nim are under tag:combinatorial-game-theory, and algorithmic aspects (e.g. Auctions) are under tag:algorithmic-game-theory.

1. Game Theory is the formal study of strategic interaction. A village with 100 married couples and a high priest. The men had to pass a logic exam before being allowed to marry. It is common knowledge that the high priest is truthful. Least one cheating wife.
2. Both players make their choices simultaneously, and game theory matrix can reflect outcomes of players’. As cheating with higher probability than an.

In game theory, battle of the sexes (BoS) is a two-player coordination game. Some authors refer to the game as Bach or Stravinsky and designate the players simply as Player 1 and Player 2, rather than assigning sex.^[1]

Imagine that Player 1 and Player 2 agreed to meet this evening, but cannot recall if they will be attending a Bach concert or a Stravinsky concert (and the fact that they forgot is common knowledge). Player 1 would prefer to go to the Stravinsky concert. Player 2 would rather go to the Bach concert. Both would prefer to go to the same place rather than different ones. If they cannot communicate, where should they go?

The payoff matrix labeled 'Bach or Stravinsky (1)' is an example of Bach or Stravinsky, where Player 1 chooses a row and Player 2 chooses a column. In each cell, the first number represents the payoff to the Player 1 and the second number represents the payoff to Player 2.

This representation does not account for the additional harm that might come from not only going to different locations, but going to the wrong one as well (e.g. Player 1 goes to the Bach concert while Player 2 goes to the Stravinsky concert, satisfying neither). To account for this, the game is sometimes represented as in 'Bach or Stravinsky (2)'.

Equilibrium analysis[edit]

This game has two pure strategyNash equilibria, one where both go to the Bach concert, and another where both go to the Stravinsky concert. There is also a mixed strategies Nash equilibrium in both games, where the players go to their preferred event more often than the other. For the payoffs listed in the first game, each player attends their preferred event with probability 3/5.

This presents an interesting case for game theory since each of the Nash equilibria is deficient in some way. The two pure strategy Nash equilibria are unfair; one player consistently does better than the other. The mixed strategy Nash equilibrium (when it exists) is inefficient. The players will miscoordinate with probability 13/25, leaving each player with an expected return of 6/5 (less than the return one would receive from constantly going to one's less favored event).

Game Theory Problem With 100 Couples And Cheating Stories

One possible resolution of the difficulty involves the use of a correlated equilibrium. In its simplest form, if the players of the game have access to a commonly observed randomizing device, then they might decide to correlate their strategies in the game based on the outcome of the device. For example, if the players could flip a coin before choosing their strategies, they might agree to correlate their strategies based on the coin flip by, say, choosing Bach in the event of heads and Stravinsky in the event of tails. Notice that once the results of the coin flip are revealed neither player has any incentives to alter their proposed actions – that would result in miscoordination and a lower payoff than simply adhering to the agreed upon strategies. The result is that perfect coordination is always achieved and, prior to the coin flip, the expected payoffs for the players are exactly equal.

Burning money[edit]

Interesting strategic changes can take place in this game if one allows one player the option of 'burning money' – that is, allowing that player to destroy some of their utility. Consider the version of Bach or Stravinsky pictured here (called Unburned). Before making the decision, Player 1 (the row player) can, in view of Player 2 (the column player), choose to set fire to 2 points making the game Burned pictured to the right. This results in a game with four strategies for each player. The row player can choose to burn or not burn the money and also choose to play Stravinsky or Bach. The column player observes whether or not the row player burns and then chooses either to play Stravinsky or Bach.

If one iteratively deletes weakly dominated strategies then one arrives at a unique solution where Player 1 does not burn the money and plays Stravinsky and where Player 2 plays Stravinsky. The odd thing about this result is that by simply having the opportunity to burn money (but not actually using it), Player 1 is able to secure their favored equilibrium. The reasoning that results in this conclusion is known as forward induction and is somewhat controversial.^[2] In brief, by choosing not to burn money, the player is indicating they expect an outcome that is better than any of the outcomes available in the 'burned' version, and this conveys information to the other party about which branch they will take.

Game Theory Problem With 100 Couples And Cheating Together

References[edit]

• Luce, R.D. and Raiffa, H. (1957) Games and Decisions: An Introduction and Critical Survey, Wiley & Sons. (see Chapter 5, section 3).
• Fudenberg, D. and Tirole, J. (1991) Game theory, MIT Press. (see Chapter 1, section 2.4)
• Kelsey, D. and S. le Roux (2015): An Experimental Study on the Effect of Ambiguity in a Coordination Game, Theory and Decision.

Game Theory Problem With 100 Couples And Cheating Relationships

1. ^Osborne, Rubinstein (1994). A course in game theory. The MIT Press.
2. ^For a detailed explanation, see [1]Archived 2012-10-15 at the Wayback Machine p8 Section 4.5.

External links[edit]

Game Theory Problem With 100 Couples And Cheating Couples

• Cooperative Solution with Nash Function by Elmer G. Wiens