Chapter 13: Problem 11
Consider a two-player contractual setting in which the players produce as a team. In the underlying game, players 1 and 2 each select high (H) or low (L) effort. A player who selects H pays a cost of 3 ; selecting \(\mathrm{L}\) costs nothing. The players equally share the revenue that their efforts produce. If they both select \(\mathrm{H}\), then revenue is 10 . If they both select \(\mathrm{L}\), then revenue is 0 . If one of them selects \(\mathrm{H}\) and the other selects \(\mathrm{L}\), then revenue is \(x\). Thus, if both players choose \(\mathrm{H}\), then they each obtain a payoff of \(\frac{1}{2} \cdot 10-3=2\); if player 1 selects \(\mathrm{H}\) and player 2 selects \(\mathrm{L}\), then player 1 gets \(\frac{1}{2} \cdot x-3\) and player 2 gets \(\frac{1}{2} \cdot x\); and so on. Assume that \(x\) is between 0 and 10 . Suppose a contract specifies the following monetary transfers from player 2 to player \(1: \alpha\) if \((\mathrm{L}, \mathrm{H})\) is played, \(\beta\) if \((\mathrm{H}, \mathrm{L})\) is played, and \(\gamma\) if \((\mathrm{L}, \mathrm{L})\) is played. (a) Suppose that there is limited verifiability in the sense that the court can observe only the revenue \((10, x\), or 0\()\) of the team, rather than the players' individual effort levels. How does this constrain \(\alpha, \beta\), and \(\gamma\) ? (b) What must be true about \(x\) to guarantee that \((\mathrm{H}, \mathrm{H})\) can be achieved with limited verifiability?
Short Answer
Step by step solution
Key Concepts
These are the key concepts you need to understand to accurately answer the question.