Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

In A Treatise on the Family (Cambridge; Harvard University Press, 1981 ), G. Becker proposes his famous Rotten Kid theorem as a game between a (potentially rotten) child, \(A\), and his or her parent, \(B . A\) moves first and chooses an action, \(r,\) that affects his or her own income \(Y_{A}(r)\) \(\left(Y_{A}^{\prime}>0\right)\) and the income of the parent \(Y_{s}(r)\left(Y_{B}^{\prime}<0\right) .\) In the second stage of the game, the parent leaves a monetary bequest of \(L\) to the child. The child cares only for his or her own utility, \(U_{A}\left(Y_{A}+L\right),\) but the parent maximizes \(U_{B}\left(Y_{B}-L\right)+X U_{A},\) where \(A>0\) reflects the parent's altruism toward the child. Prove that the child will opt for that value of \(r\) that maximizes \(Y_{A}+Y_{B}\) even though he or she has no altruistic intentions. Plint: You must first find the parent's optimal bequest, then solve for the child's optimal strategy, given this subsequent parental behavior.)

Short Answer

Expert verified
In conclusion, the Rotten Kid theorem states that a selfish child will choose a strategy that maximizes the sum of the parent's and their own income in an optimal bequest scenario. By finding the parent's optimal bequest and the child's optimal strategy that maximizes their utility, we proved the theorem. The child's optimal strategy involves choosing a value for r that satisfies \(Y_A'(r) + Y_B'(r) = 0\), meaning that the child will maximize the sum of incomes, \(Y_A + Y_B\), even without altruistic motives.

Step by step solution

01

Find the parent's optimal bequest

To find the parent's optimal bequest, we need to take the first-order derivative of their utility function with respect to L, and set it equal to zero. This will help us determine the optimal value of L that maximizes the parent's utility. The parent's utility function is given by: \(U_B(Y_B - L) + XU_A\) Taking the derivative with respect to L gives: \(\frac{dU_B}{dL} = -U_B'(Y_B - L) + XU_A'(Y_A + L)\) Now, we need to find the value of L that sets this derivative to zero: \(-U_B'(Y_B - L) + XU_A'(Y_A + L) = 0\) Rearranging to solve for L: \(L = \frac{U_B'(Y_B - L)}{XU_A'(Y_A + L)}\)
02

Find the child's optimal strategy

Now, we need to find the child's optimal strategy, which means determining the value of r that maximizes their utility. The child's utility function is given by: \(U_A(Y_A + L)\) We already found the optimal bequest, L, in step 1. Plugging the value of L from step 1 into the child's utility function gives: \(U_A \left(Y_A + \frac{U_B'(Y_B - L)}{XU_A'(Y_A + L)}\right)\) Now we need to find the optimal r by taking the derivative of this function with respect to r and setting it equal to zero: \(\frac{dU_A}{dr} = Y_A'(r) + \frac{U_B''(Y_B - L)Y_B'(r) - XU_A''(Y_A + L)Y_A'(r)}{[XU_A'(Y_A + L)]^2} = 0\) This is a complicated expression, but we can notice that the denominator will not affect the sign of the derivative, so we can ignore it for the maximization problem. We can rearrange the remaining terms to solve for the optimal r: \(Y_A'(r) = XU_A''(Y_A + L)Y_A'(r) - U_B''(Y_B - L)Y_B'(r)\) According to the problem statement, we have \(Y_A'(r)>0\) and \(Y_B'(r)<0\). The equation above implies that the optimal r must have \(Y_A'(r) + Y_B'(r) = 0\), which means that the child's optimal strategy is choosing r to maximize the sum of incomes, \(Y_A + Y_B\), even though they have no altruistic intentions.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Smith and Jones are playing a number-matching game. Each chooses either \(1,2,\) or \(3 .\) If the numbers match, Jones pays Smith \(\$ 3 .\) If they differ, Smith pays Jones \(\$ 1\) a Describe the payoff matrix for this game and show that it does not possess a Nash equi librium strategy pair. b. Show that with mixed strategies this game does have a Nash equilibrium if each player plays each number with probability Vs. What is the value of this game?

Fudenberg and Tirole (1992) develop a game of stag-hunting based on an observation originally made by Rousseau. The two players in the game may either cooperate in catching a stag or each may set out on his own to catch a hare. The payoff matrix for this game is given by a Describe the Nash equilibria in this game. b. Suppose \(B\) believes that \(A\) will use a mixed strategy in choosing how to hunt. How will 5 's optimal strategy choice depend on the probability \(A\) will play stag? c. Suppose this game is expanded to \(n\) players (the game Rousseau had in mind) and that all \(n\) must cooperate in order for a stag to be caught. Assuming that the payoffs for one specific player, say \(B\), remain the same and that all the other \(n-1\) players will opt for mixed strategies, how will \(B\) 's optimal strategy depend on the probabilities with which each of the other players plays stag? Explain why cooperation seems less likely in this larger game.

Players \(A\) and \(B\) have found \(\$ 100\) on the sidewalk and are arguing about how it should be split. A passerby suggests the following game: "Each of you state the number of dollars that you wish \(\left(d_{d}, d_{B}\right) .\) If \(d_{A}+d_{B} \wedge 100\) you can keep the figure you name and I'll take the remainder. If \(d_{A}+d_{B}>100,\) I'll keep the \(\$ 100 . "\) Is there a unique Nash equilibrium in this game of continuous strategies?

Consider the following sealed-bid auction for a rare baseball card. Player \(A\) values the card being auctioned at \(\$ 600,\) player lvalues the card at \(\$ 500,\) and these valuations are known to each player who will submit a sealed bid for the card. Whoever bids the most will win the card. If equal bids are submitted, the auctioneer will flip a coin to decide the winner. Each player must now decide how much to bid. a. How would you categorize the strategies in this game? Do some strategies dominate others? b. Does this game have a Nash equilibrium? Is it unique? c. How would this game change if each player did not know the other's valuation for the card?

The game of "chicken" is played by two macho teens who speed toward each other on a single-lane road. The first to veer off is branded the chicken, whereas the one who doesn't turn gains peer group esteem. Of course, if neither veers, both die in the resulting crash. Payoffs to the chicken game are provided in the following table. a. Does this game have a Nash equilibrium? b. Is a threat by either not to chicken-out a credible one? c. Would the ability of one player to firmly commit to a not-chicken strategy (by, for example, throwing away the steering wheel) be desirable for that player?

See all solutions

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free