| Index: > A B C D E F G H I J K L M N O P Q R S T U V W X Y Z |
|
|||||
| First Prev [ 1 2 3 4 ] Next Last |
Many players, instead of two players, may cooperate to get a better outcome. Again, how much share should be given to each player of the total output is not clear. Core gives a reasonable set of possible shares. A combination of shares is in a core if there exists no subcoalition in which its members may gain a higher total outcome than the share of concern. If the share is not in a core, some members may be frustrated and may think of leaving the whole group with some other members and form a smaller group.
In games of complete information each player has the same game-relevant information as every other player. Chess and the prisoner's dilemma exemplify complete-information games, while poker illustrates the opposite. Complete information games occur only rarely in the real world, and game theorists usually use them only as approximations of the actual game played..
For the above example to work, one must assume risk-neutral participants in the game. For example, this means that they would value a bet with a 50% chance of receiving 20 points and a 50% chance of paying nothing as worth 10 points. However, in reality people often exhibit risk averse behaviour and prefer a more certain outcome - they will only take a risk if they expect to make money on average. Subjective expected utility theory explains how to derive a measure of utility which will always satisfy the criterion of risk neutrality, and hence serve as a measure for the payoff in game theory.
Game shows often provide examples of risk aversion. For example, if a person has a 1 in 3 chance of winning $50,000, or can take a sure $10,000, many people will take the sure $10,000. Lotteries can show the opposite behaviour of risk seeking: for example many people will risk $1 to buy a 1 in 14,000,000 chance of winning $7,000,000.In a surprising connection, he found that a certain subclass of these games can be used as numbers as described in his book On Numbers and Games, leading to the very general class of surreal numbers.
Though touched on by earlier mathematical results, modern game theory became a prominent branch of mathematics in the 1940s, especially after the 1944 publication of The Theory of Games and Economic Behavior by John von Neumann and Oskar Morgenstern. This profound work contained the method -- alluded to above -- for finding optimal solutions for two-person zero-sum games.
Around 1950, John Nash developed a definition of an "optimum" strategy for multi-player games where no such optimum was previously defined, known as Nash equilibrium. Reinhard Selten with his ideas of trembling hand perfect and subgame perfect equilibria further refined this concept. These men won The Bank of Sweden Prize in Economic Sciences in Memory of Alfred Nobel in 1994 for their work on game theory, along with John Harsanyi who developed the analysis of games of incomplete information.
Research into game theory continues, and there remain games which produce counter-intuitive optimal strategies even under advanced analytical techniques like trembling hand equilibrium. One example of this occurs in the Centipede Game, where at every decision players have the option of increasing their opponents' payoff at some cost to their own.
Some experimental tests of games indicate that in many situations people respond instinctively by picking a 'reasonable' solution or a 'social norm' rather than adopting the strategy indicated by a rational analytic concept.
The finding of Conway's number-game connection occurred in the early 1970s.