15
Part III · Playing with people

Take it or leave it

Ten coins. You say how to split them, and Robo can say yes or no. If Robo says no, nobody gets anything. Working backwards from the end, the way you did in Chapter 5, says you should offer one coin and Robo should take it. Real people refuse that offer, and they are not being silly. By the end of this chapter you will know why both answers are right, and you will be able to split loot with pirates and a melting cake.

Here is the game. There are 10 coins on the table. One player, the proposer, says how to split them: "I keep 7, you get 3." The other player, the responder, says yes or no. Yes: the split happens. No: the coins go back in the box and nobody gets anything. One offer, one answer, no haggling. It is called the ultimatum game (say: ul-ti-MAY-tum), because an ultimatum is a take-it-or-leave-it offer.

You go first, as the proposer. This Robo is not a pure backward-inducer. It is built to act like a person: it has a secret minimum, some number from 1 to 5, and it says yes only when your offer is at least that. Below its minimum it says no, and you both get nothing. You get 10 rounds against the same Robo. Your job is to find its minimum without wasting too many rounds, and then never pay one coin more than you have to.

The star works like this. A player who knew the minimum m from the start could keep 10 − m coins every round, 10 × (10 − m) in total. You earn the star if you keep at least 80 percent of that. So you can afford to lose about two rounds' worth of coins finding out. Think about where to start probing: from the top, from the bottom, or from the middle. One of those is a bad idea.

The ultimatum: you propose

10 coins. You offer a split. Robo says yes or no. No means nobody gets anything.
Give Robo:
Round1 of 10
You0
Robo0
Robo said no0
Robo's minimum changes every time you press this.

Now switch chairs. Robo proposes and you respond. Robo will be stingy. Before each answer, notice what you want to do, and then do that. There is no wrong answer in this box. This is the part where you find out what kind of responder you are.

The ultimatum: Robo proposes

Robo offers you some coins. Yes: the split happens. No: nobody gets anything.
Round1 of 10
You0
Robo0
If you said yes to all0

Look at your total next to the "yes to all" total. Backward induction says: when Robo offers 1 coin, you are choosing between 1 coin and 0 coins, and 1 is more than 0, so say yes. Say yes to everything. Most people do not. In experiments with real money, offers below about 20 to 30 percent of the pot get turned down a lot of the time, even though turning them down costs the responder real money. If you said no to a 1-coin offer, you were in good company. If you said yes to everything, you were following the theory. Both are honest, and the gap between them is the whole point of this chapter.

Why theory says one coin

Solve the ultimatum game the way you solved the 21 Game: start at the end.

  1. The last move. The responder is looking at an offer of x coins, with x at least 1. Yes gives x. No gives 0. Since x > 0, a responder who cares only about coins says yes to any offer of 1 or more.
  2. One step back. The proposer knows step 1. Every offer of 1 or more will be accepted, so the proposer picks the smallest one: 1 coin, and keeps 9.
  3. Why not 0? An offer of 0 leaves the responder choosing between 0 and 0. There is nothing to gain by saying yes, so the offer might be refused out of spite. One coin is the smallest offer that gives the responder a real reason to say yes.

So the prediction is: offer 1, accept. Something against nothing, then the smallest something. That is the backward-induction answer, and it is exactly right for the game as written.

And it is wrong about people. When the ultimatum game is played for real money, proposers usually offer 4 or 5 coins out of 10, and responders usually refuse 1 or 2. Is the theory broken? Not quite. Backward induction was solving a game whose payoffs were "coins, and nothing else." The people in the experiment are playing a game with different payoffs. They care about coins, and they also care about being treated fairly, and about punishing someone who treats them unfairly, even when the punishment costs them. Put those things into the payoffs and the same backward induction gives a different answer: the responder refuses 1 coin because "nothing, and I taught a cheapskate a lesson" is worth more to them than 1 coin, and a proposer who knows that offers more.

Remember Chapter 1: a game is the rules plus what each player wants. The math was fine. The mistake was in the payoffs. The hard part of playing with people is not the backward induction. It is knowing what the other player actually wants.

The pirate game

Five pirates have found a chest of 100 gold coins. They are ranked by seniority: A is the captain, then B, C, D, and E. The rules for splitting the loot:

  • The most senior pirate proposes a split.
  • Everybody votes, including the proposer.
  • If at least half the pirates vote yes, the split happens and the game is over.
  • Otherwise the proposer is thrown overboard, and the next most senior pirate proposes.

Every pirate wants, in this order: to stay alive, to get as many coins as possible, and, when nothing else is at stake, to throw someone overboard. They are all perfect backward-inducers, and they all know it.

What should A propose? Guess before you compute. Most people guess that A has to give away a lot to avoid a swim. The truth is stranger. The trick is Chapter 5's trick: do not start with 5 pirates. Start with 2, and work backward. At each step, predict the proposal in the boxes, then check. A pirate votes yes only when the offer is strictly better than what they would get if the proposer went overboard. Equal is not enough. With equal coins, the pirate takes the option with a splash.

Five pirates, 100 coins

At least half the votes, counting the proposer's own, and the split happens.

Once you have seen all four steps, switch to Play as pirate A. The other four pirates vote for real, each one comparing your offer to what they would get if you went overboard. If you want to be sure the pattern is not a coincidence, try 6 or 7 pirates.

Splitting a shrinking pie

In the ultimatum game there is one offer. Real bargaining goes back and forth, and while it goes on, something is usually lost: time, patience, or ice cream cake. Here is the simplest version.

An ice cream cake worth 100 is melting. In round 1 you propose a split and Robo accepts or rejects. If Robo rejects, the cake loses 20 percent of its value (it is now worth 80) and in round 2 Robo proposes and you respond. If you reject, it loses another 20 percent (worth 64) and in round 3 you propose one last time. If that fails too, the cake is a puddle and nobody gets anything.

This Robo is a pure backward-inducer. It accepts an offer exactly when the offer is at least what it could guarantee itself by saying no and playing on. Before you play, work out what that number is in round 1. It is the same reasoning as the pirates: start from round 3. The star is for a first offer that Robo accepts and that keeps at least 84 for you.

The melting cake

Worth 100 now. Each round without a deal, it loses 20 percent. After the last round, nothing is left.

Round 1 of 3. Cake worth 100.

Math corner

The melting cake, backwards. Round 3 is worth 100 × 0.8 × 0.8 = 64, and you propose. Robo can guarantee itself nothing by refusing, so you keep all 64. Round 2 is worth 80 and Robo proposes. You can guarantee yourself 64 by refusing, so Robo must offer you 64 and keeps 80 − 64 = 16. Round 1 is worth 100 and you propose. Robo can guarantee 16, so you offer 16 and keep 100 − 16 = 84. With a shrink factor d instead of 0.8, the same three steps give

you keep 100 × (1 − d + d²) = 100 × (1 − 0.8 + 0.64) = 84

Notice that a bargainer who is exactly indifferent is assumed to say yes. If Robo demanded strictly more than 16, you would offer 17 and keep 83. The whole answer moves by one coin, which tells you the assumption is a small one.

The pirates as a formula. The proposer needs at least half the votes, counting their own, so the number of votes to buy is ⌈n/2⌉ − 1, which is the same number as ⌊(n − 1)/2⌋. Each vote costs 1 coin, bought from a pirate who would otherwise get 0. So with 100 coins and n pirates,

the proposer keeps 100 − ⌊(n − 1)/2⌋

as long as that is at least 0, which means n up to 201. The brackets ⌊ ⌋ mean "round down" and ⌈ ⌉ mean "round up". Check: 5 pirates gives 100 − 2 = 98, 7 pirates gives 100 − 3 = 97.

"At least half" versus "more than half". Everything hangs on the two-pirate case. With "at least half", D's own vote is 1 of 2, which is enough, so D keeps all 100. With "more than half", D's single vote is not enough, D goes overboard, and E takes everything. Now D will vote for anything C proposes, just to stay alive, so with 3 pirates C keeps all 100 and gives D nothing. One word in the rules changes every answer up the chain.

Big idea

Backward induction gives sharp answers: one coin, 98 for the captain, 84 for whoever offers first. Those answers are exactly right for the game as written. When the other player is a person, the payoffs include things that are not written down, like fairness and pride, and you have to put those in before the answer is worth trusting.

Try it on paper

1. The ultimatum game with 100 coins. What does backward induction say the proposer offers, and what happens to that offer with real people?

Answer

Offer 1 coin and keep 99, because 1 coin is more than 0 and the responder is supposed to prefer more. With real people, a 1-coin offer out of 100 is nearly always refused, and proposers who know that offer 30 to 50 coins.

2. The pirate game with 3 pirates (C, D, E) and only 10 coins. What does C propose?

Answer

If C goes overboard, D proposes 10 for D and 0 for E, and D's own vote carries it. So E can be bought for 1 coin. C proposes 9, 0, 1: C and E vote yes, 2 of 3 is at least half, and it passes.

3. The melting cake with only 2 rounds. You propose in round 1, and Robo proposes in round 2. What is your first offer?

Answer

Round 2 is worth 80 and Robo proposes, so Robo keeps all 80. In round 1 you must offer Robo 80 and keep 20. Having the last word is worth a lot: with 3 rounds the last word is yours and you keep 84. Switch the cake game to 2 rounds and try it.

Challenge

Now 200 pirates find the same 100 coins. What does the captain propose, and does it pass? Then push it further. Somewhere above 200 the pattern breaks. Find where, and work out what happens to the captain there. Big crews mode on the pirate board will check your reasoning.

Answer

With 200 pirates the captain needs ⌈200/2⌉ − 1 = 99 other votes, buys 99 of the pirates who would get 0, and keeps 100 − 99 = 1. It passes. With 201 the captain keeps 0 and survives. With 202 the captain needs 100 votes and has exactly 100 coins to buy them with, so the captain survives with nothing.

With 203 the captain needs 101 votes and has only 100 coins. No proposal can pass, and the captain goes overboard no matter what. That changes the next case: with 204 pirates, the pirate who would become the doomed captain of 203 votes yes to anything, for free, to stay alive. So 204's captain gets one free vote, buys 100 more, and survives with nothing. After that it gets strange: the captains who survive are the crews of size 202, 204, 208, 216, 232, and so on, 202 plus a power of 2, and every other captain between them is thrown overboard. Ian Stewart's article "A Puzzle for Pirates" explains why.

True story

The ultimatum game was first played for real money in 1982 by Werner Güth and two colleagues at the University of Cologne, and their players did not behave the way the textbook said: low offers were refused, and most proposers did not make them. In 2000 the anthropologist Joseph Henrich took the same game to the Machiguenga people of the Peruvian Amazon. They made much lower offers than students in America and Europe, and they accepted them, which showed that what counts as "fair" is partly learned from the people around you. The pirate game is older than anyone can trace, but it became famous in 1999 when the mathematician Ian Stewart wrote about it in Scientific American under the title "A Puzzle for Pirates", and pushed the crew up to 500 to see what happened.

Stars in this chapter

Earn them by doing the clever thing, not by clicking around.