Table 1. Outcome matrix of the fair bidding game.
Player 2 | |||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
50 | 40 | 30 | 20 | 10 | 0 | ||||||||
50 | 60 | 60 | 120 | 10 | 120 | 20 | 120 | 30 | 120 | 40 | 120 | 50 | |
40 | 10 | 120 | 70 | 70 | 130 | 20 | 130 | 30 | 130 | 40 | 130 | 50 | |
Player 1 | 30 | 20 | 120 | 20 | 130 | 80 | 80 | 140 | 30 | 140 | 40 | 140 | 50 |
20 | 30 | 120 | 30 | 130 | 30 | 140 | 90 | 90 | 150 | 40 | 150 | 50 | |
10 | 40 | 120 | 40 | 130 | 40 | 140 | 40 | 150 | 100 | 100 | 160 | 50 | |
0 | 50 | 120 | 50 | 130 | 50 | 140 | 50 | 150 | 50 | 160 | 50 | 50 |
Note. The matrix illustrates the outcomes for each player before the corrupt option is introduced to the game. The range of bidding options for each player are in italics. The outcomes for player 1 are in bold. The dominant strategy for both players is allocating 50 credits.