![]() ![]() |
|
Full Show Index Home Search RNO Article Archive Feedback E-mail Updates Advertise With Us Write For Us |
Is the Key to Survivor in 'Non-Cooperative Games'?by Kennedy Goodkey -- 12/24/2002
View Printable version of this article I've been casually interested in game theory for a few years now - not quite as long as I've been a Survivor addict. I suspect that there is a correlation between the two. I've long since held that the key to winning Survivor lay in a sharp critical understanding of non-zero sum games without perfect information for more than two players. Huh? Well Jeff Probst let the cat out of the bag at the end of the reunion special on Thursday night. Too bad. I've been quietly keeping that to myself for the day that eligibility rules change and Canadians are able to participate in Survivor. So before anyone gets to demonstrate it on the show, I thought I better take my opportunity to illuminate the details in my best layman's terms. First a disclaimer: I am not a mathematician - and anything I've learned on the subject after high school is entirely self-taught. So anything I say could well be subject to correction by someone with a real education. Jeff recommended John Nash's "Non-Cooperative Games." If the name is familiar, it's because John Nash is the real mathematician who Russell Crowe played in last year's Best Picture Oscar winner, A Beautiful Mind (you can read the NonfictionReviews.com review of the book on which the movie was based by clicking here). The paper (which can be found, along with others, in the book, The Essential John Nash) is the basis for which he was awarded the Nobel Prize. Mathematically speaking it is a revolutionary work of science. It would not be unfair to say that its impact is akin to Darwin's "Origin of Species" or Einstein's "Theory of Relativity." But in fact, there is a LOT more to Game Theory that could be of use in Survivor. For example: In episode six of Thailand, the immunity challenge was a game called Thai 21. This is one of the most basic of mathematical games, one that would come up very early in any study of game theory. If each team had a player with the right mathematical skill, the first team to move would have won the game - every time. This did not happen. You may recall, there were 21 flags and each team in order had the opportunity to remove 1,2, or 3 flags. The team to remove the last flag won immunity. Sook Jai relinquished control by leaving Chuay Ghan with ten flags when they could have left them with twelve. I've long since erased the tape I had it on, but I recall thinking, "Oh, there - they just blew it. And sure enough Chuay Ghan and Sook Jai both soon noticed that the game was inevitably going to Chuay Ghan. How so? A team with an unbeatable strategy will always leave the opposing team with a multiple of the maximum number of flags that a team can take plus one. In this way the opposing team cannot avoid leaving a savvy controlling team in control. In the case of Thai 21, the team with control would leave the opponent with 20 flags the first turn. No matter how many flags were then taken by the opponent, the team in control could then leave the opponent with 16 flags and then 12 and then 8 and lastly 4. Left with only four flags and the requirement to take at least one, but not more than three, means that you MUST put the opponent within range of winning, but cannot win yourself. It is a 'master-move.' But this example game is child's play compared to the intricacies of Survivor's uber-game... Tribal Politics! Nash's greatest feat of intellectual achievement is the formulation of the Nash Equilibrium. The Nash Equilibrium is a wonderfully simple idea, but very difficult to master in practice. In fact, the basic idea is SO simple that you'll think, "Well, THAT is obvious." But keep in mind, it's also easy for us to understand that the Earth goes around the Sun, not the other way around. Before Copernicus it seemed illogical to accept anything other than the Ptolemaic view that the Earth was the center of the Universe and that everything else surrounded it. Let's take this one step at a time. In any game of strategy, the outcome hinges not only on what YOU as a player do, but what every other player does. Furthermore, this applies to each player individually. In a two-player game where both players' moves and options for moves are available to each and each player moves in sequence, there is a fixed number of possible options. In a game like Tic-Tac-Toe, or even Thai 21, the various options are relatively easy to calculate and react to. In Chess, things get more complicated, but essentially the principle of looking ahead in the game to determine the best possible strategy based on a limited number of options and no hidden information remains the same. The other player's specific strategy may be unknown, but you always know what the situation on the board is - what pieces are in play, what options are available. But Survivor and Chess have very little in common. Unless you're playing some new version of Chess where there are sixteen players, none of them actually have their pieces on the table, all players move whenever they feel like it, at regular intervals players are forced to checkmate someone but at any given time there's at least one player you aren't allowed to checkmate, and players are allowed to make agreements behind each other's backs. Okay, no matter how you cut it, Chess is nothing like Survivor - people should quit making naïve comparisons to it. 1 2 Next-->View Printable version of this article |