Skip to main content

Curling and the minimax theorem

Every four years, as the Winter Olympics hits town, a sizable proportion of the British population falls in love with the sport of curling. And that offers the chance to look afresh at game theory's 'first big result' - the Minimax Theorem. 
       Curling is often called 'chess on ice'. But, that analogy only goes so far because chess is a game of complete information and curling is not: If a chess player intends to move a bishop to E4 then we can be pretty sure he will move it to E4. He is not going to mistakenly move it to D3, and a gust of wind is not going to move it F5. Curling, by contrast, involves both skill and luck. Skill is required to put the stone where it was intended. And luck is needed because debris on the ice can deflect a stone, and so on. So, while chess is a pure game of strategy, curling is a game of strategy, skill and luck. 
          The fact that chess is a pure a game of strategy makes it relatively easy to analyze. It is no surprise, therefore, that chess has played an integral role in the development of game theory. But, the fact that chess is a pure game of strategy also makes it a relatively boring game to watch! The Minimax Theorem helps 'formalize' this latter point. One element of the Theory says that in a zero-sum game (of which chess is an example) any Nash equilibrium yields the same payoff to players. In principle, this means that if both players behave optimally the outcome - white wins, a draw, or black wins - is predictable before the players sit down to begin their game. And that does not make for much exciting! 
         To see this in practice consider a simple game like tick-tac-toe (or noughts and crosses). It does not take much time to realize that the outcome if both players behave optimally is a draw. And once you know that, there is not much fun in playing. With chess things are not quite so simple, because the game is complex enough that we do not know the optimal strategy. That's why grandmasters still compete. Grandmasters will, however, concede a game well before the game is technically over because the outcome is clear. And, this level of predictability does not lend itself to much excitement for people watching. 
       The skill and luck involved in curling makes the outcome much less clear. That can generate more excitement. Unpredictability can also, however, lead to a more fundamental difference than that generated by pure random chance. That's because of the way it changes the optimal strategy. Let me explain: At first sight the 'optimal strategy' in a game will typically be a 'boring' one. In curling, for instance, once a team is ahead in the match they can play a 'boring' strategy of keeping the house clean in order to maintain their advantage. In a game of complete information, like chess or tic-tac-toe, there is no point in doing anything other than the boring strategy because you can be sure it will succeed. In a game of incomplete information, however, the boring strategy is risky. It is risky because it might not work, and losing with a boring strategy does not go down well.
        To illustrate the point let me contrast two curling matches from the Winter Olympics. In the men's semi-final between Britain and Sweden, Britain had the chance to employ a boring strategy and chose not to do so. It nearly cost them, but they hung on and are currently the toast of Britain. In the women's final between Canada and Sweden, Canada did opt for a boring strategy. As soon as they did so the commentators became critical and many were hoping it would fail. It did not fail, but the point is still made. If Canada had lost that game playing such a strategy they would have been roundly criticized by everyone. The possibility of such an outcome may mean the boring strategy was not optimal. 
        My conjecture, therefore, is that in games where skill and luck play a role players will have a tendency to shun 'boring' strategies. If a boring strategy is no guarantee of success then it is just too risky. This makes for a more exciting game. And we don't have to stick with curling to see this in practice. Football and cricket teams, for example, that lose with a 'boring' strategy never get much praise.  

Comments

Popular posts from this blog

Revealed preference, WARP, SARP and GARP

The basic idea behind revealed preference is incredibly simple: we try to infer something useful about a person's preferences by observing the choices they make. The topic, however, confuses many a student and academic alike, particularly when we get on to WARP, SARP and GARP. So, let us see if we can make some sense of it all.           In trying to explain revealed preference I want to draw on a  study  by James Andreoni and John Miller published in Econometrica . They look at people's willingness to share money with another person. Specifically subjects were given questions like:  Q1. Divide 60 tokens: Hold _____ at $1 each and Pass _____ at $1 each.  In this case there were 60 tokens to split and each token was worth $1. So, for example, if they held 40 tokens and passed 20 then they would get $40 and the other person $20. Consider another question: Q2. D...

Measuring risk aversion the Holt and Laury way

Attitudes to risk are a key ingredient in most economic decision making. It is vital, therefore, that we have some understanding of the distribution of risk preferences in the population. And ideally we need a simple way of eliciting risk preferences that can be used in the lab or field. Charles Holt and Susan Laury set out one way of doing in this in their 2002 paper ' Risk aversion and incentive effects '. While plenty of other ways of measuring risk aversion have been devised over the years I think it is safe to say that the Holt and Laury approach is the most commonly used (as the near 4000 citations to their paper testifies).           The basic approach taken by Holt and Laury is to offer an individual 10 choices like those in the table below. For each of the 10 choices the individual has to go for option A or option B. Most people go for option A in choice 1. And everyone should go for option B in choice 10. At some point, therefore, we expect the...

Nash bargaining solution

Following the tragic death of John Nash in May I thought it would be good to explain some of his main contributions to game theory. Where better to start than the Nash bargaining solution. This is surely one of the most beautiful results in game theory and was completely unprecedented. All the more remarkable that Nash came up with the idea at the start of his graduate studies!          The Nash solution is a 'solution' to a two-person bargaining problem . To illustrate, suppose we have Adam and Beth bargaining over how to split some surplus. If they fail to reach agreement they get payoffs €a and €b respectively. The pair (a, b) is called the disagreement point . If they agree then they can achieve any pair of payoffs within some set F of feasible payoff points . I'll give some examples later. For the problem to be interesting we need there to be some point (A, B) in F such that A > a and B > b. In...