- Solution concept
game theory, a solution concept is a formal rule for predicting how the game will be played. These predictions are called "solutions", and describe which strategies will be adopted by players, therefore predicting the result of the game. The most commonly used solution concepts are equilibrium concepts, most famously Nash equilibrium.
Many solution concepts, for many games, will result in more than one solution. This puts any one of the solutions in doubt, so a game theorist may apply a refinement to narrow down the solutions. Each successive solution concept presented in the following improves on its predecessor by eliminating implausible equilibria in richer games.
Let be the class of all games and, for each game , let be the set of
strategy profiles of . A "solution concept" is an element of the direct product "i.e"., a function such that for all
Rationalizability and iterated dominance
In this solution concept, players are assumed to be rational and so strictly dominated strategies are eliminated from the set of strategies that might feasibly be played. A strategy is strictly dominated when there is some other strategy available to the player that always has a higher payoff, regardless of the strategies that the other players choose. (Strictly dominated strategies are also important in
minimax game-tree search.) For example, in the (single period) prisoners' dilemma (shown below), "cooperate" is strictly dominated by "defect" for both players because either player is always better off playing "defect", regardless of what his opponent does.
A Nash equilibrium is a
strategy profile(a strategy profile specifies a strategy for every player, e.g. in the above prisoners' dilemma game ("cooperate", "defect") specifies that prisoner 1 plays "cooperate" and player 2 plays "defect") in which every strategy is a best response to every other strategy played. A strategy by a player is a best responseto another player's strategy if there is no other strategy that could be played that would yield a higher pay-off in any situation in which the other player's strategy is played.
There are games that have multiple Nash equilibria, some of which are unrealistic. In the case of dynamic games, unrealistic Nash equilibria might be eliminated by applying backward induction, which assumes that future play will be rational. It therefore elimates noncredible (or incredible) threats because such threats would be irrational to carry out if a player was ever called upon to do so.
For example, consider a dynamic game in which the players are an incumbent firm in an industry and a potential entrant to that industry. As it stands, the incumbent has a monopoly over the industry and does not want to lose some of its market share to the entrant. If the entrant chooses not to enter, the payoff to the incumbent is high (it maintains its monopoly) and the entrant neither loses nor gains (its payoff is zero). If the entrant enters, the incumbent can fight or accommodate the entrant. It will fight by lowering its price, running the entrant out of business (and incurring exit costs – a negative payoff) and damaging its own profits. If it accommodates the entrant it will lose some of its sales, but a high price will be maintained and it will receive greater profits than by lowering its price (but lower than monopoly profits).
If the entrant enters, the best response of the incumbent is to accommodate. If the incumbent accommodates, the best response of the entrant is to enter (and gain profit). Hence the strategy profile in which the incumbent accommodates if the entrant enters and the entrant enters if the incumbent accommodates is a Nash equilibrium. However, if the incumbent is going to play fight, the best response of the entrant is to not enter. If the entrant does not enter, it does not matter what the incumbent chooses to do (since there is no other firm to do it to - note that if the entrant does not enter, fight and accommodate yield the same payoffs to both players; the incumbent will not lower its prices if the entrant does not enter). Hence fight can be considered as a best response of the incumbent if the entrant does not enter. Hence the strategy profile in which the incumbent fights if the entrant does not enter and the entrant does not enter if the incumbent fights is a Nash equilibrium. Since the game is dynamic, any claim by the incumbent that it will fight is an incredible threat because by the time the decision node is reached where it can decide to fight (i.e. the entrant has entered), it would be irrational to do so. Therefore this Nash equilibrium can be eliminated by backward induction.
*Monetary policy theory
ubgame perfect Nash equilibrium
A generalisation of backward induction is subgame perfection. Backward induction assumes that all future play will be rational. In subgame perfect equilibria, play in every
subgameis rational (specifically a Nash equilibrium). Backward induction can only be used in terminating (finite) games of definite length and cannot be applied to games with imperfect information. In these cases, subgame perfection can be used. The eliminated Nash equilibrium described above is subgame imperfect because it is not a Nash equilibrium of the subgame that starts at the node reached once the entrant has entered.
Perfect Bayesian equilibrium
Sometimes subgame perfection does not impose a large enough restriction on unreasonable outcomes. For example, since subgames cannot cut through information sets, a game of imperfect information may have only one subgame – itself – and hence subgame perfection cannot be used to eliminate any Nash equilibria. A perfect Bayesian equilibrium (PBE) is a specification of players’ strategies "and beliefs" about which node in the information set has been reached by the play of the game. A belief about a decision node is the probability that a particular player thinks that that node is or will be in play (on the "equilibrium path"). In particular, the intuition of PBE is that it specifies player strategies that are rational given the player beliefs it specifies and the beliefs it specifies are consistent with the strategies it specifies.
In a Bayesian game a strategy determines what a player plays at every information set controlled by that player. The requirement that beliefs are consistent with strategies is something not specified by subgame perfection. Hence, PBE is a consistency condition on players’ beliefs. Just as in a Nash equilibrium no player’s strategy is strictly dominated, in a PBE, for any information set no player’s strategy is strictly dominated beginning at that information set. That is, for every belief that the player could hold at that information set there is no strategy that yields a greater expected payoff for that player. Unlike the above solution concepts, no player’s strategy is strictly dominated beginning at any information set even if it is off the equilibrium path. Thus in PBE, players cannot threaten to play strategies that are strictly dominated beginning at any information set off the equilibrium path.
The "Bayesian" in the name of this solution concept alludes to the fact that players update their beliefs according to
Bayes' theorem. They calculate probabilities given what has already taken place in the game.
Forward induction is so called because just as backward induction assumes future play will be rational, forward induction assumes past play was rational. Where a player does not know what "type" another player is (i.e. there is imperfect and asymmetric information), that player may form a belief of what type that player is by observing that player's past actions. Hence the belief formed by that player of what the probability of the opponent being a certain type is based on the past play of that opponent being rational.
* Cho, I-K. & Kreps, D. M. (1987) Signaling games and stable equilibria. "Quarterly Journal of Economics" 52:179-221.
* Harsanyi, J. (1973) Oddness of the number of equilibrium points: a new proof. "International Journal of Game Theory" 2:235-250.
* Hines, W. G. S. (1987) Evolutionary stable strategies: a review of basic theory. "Theoretical Population Biology" 31:195-272.
* Noldeke, G. & Samuelson, L. (1993) An evolutionary analysis of backward and forward induction. "Games & Economic Behaviour" 5:425-454.
* Maynard Smith, J. (1982) "
Evolution and the Theory of Games". ISBN 0-521-28884-3
* Selten, R. (1983) Evolutionary stability in extensive two-person games. "Math. Soc. Sci." 5:269-363.
* Selten, R. (1988) Evolutionary stability in extensive two-person games --- correction and further development. "Math. Soc. Sci." 16:223-266
* Thomas, B. (1985a) On evolutionary stable sets. "J. Math. Biol." 22:105-115.
* Thomas, B. (1985b) Evolutionary stable sets in mixed-strategist models. "Theor. Pop. Biol." 28:332-341
Extensive form game
Trembling hand equilibrium
The Intuitive Criterion" (Cho and Kreps 1987)
Wikimedia Foundation. 2010.
См. также в других словарях:
Concept De Solution — En théorie des jeux et en théorie économique, un concept de solution est un processus par lequel les équilibres d un jeu sont identifiés. Ils sont donc employés comme des prédictions de jeu, suggérant quel sera le résultat du jeu, c est à dire… … Wikipédia en Français
Solution Unsatisfactory — is a science fiction short story by Robert A. Heinlein. The story was first published in Astounding Science Fiction magazine in 1940, with illustrations by Frank Kramer. The time of writing (at least of the final draft) can be bracketed very… … Wikipedia
Solution focused brief therapy — (SFBT), often referred to as simply solution focused therapy or brief therapy , is a type of talking therapy that is based upon social constructionist philosophy. It focuses on what clients want to achieve through therapy rather than on the… … Wikipedia
Concept Development and Experimentation — Concept Development Experimentation (CD E) is the application of the structure and methods of experimental science to the challenge of developing future military capability. CD E is a forward looking process for developing and evaluating new… … Wikipedia
Concept de solution — Quelques concepts de solution de théorie des jeux. Les flèches vont d un raffinement à un concept plus général (par exemple, tout équilibre à main tremblante est un équilibre parfait en sous jeux). En théorie des jeux et en théorie économique, un … Wikipédia en Français
Solution Finale — Shoah Pour les articles homophones, voir choix, Choa et Shoa. Destruction du … Wikipédia en Français
Solution finale — Shoah Pour les articles homophones, voir choix, Choa et Shoa. Destruction du … Wikipédia en Français
Solution finale de la question juive — Shoah Pour les articles homophones, voir choix, Choa et Shoa. Destruction du … Wikipédia en Français
Concept map — For concept maps in generic programming, see Concept (generic programming). Example concept map, created using the IHMC CmapTools computer program. A concept map is a diagram showing the relationships among concepts. It is a graphical tool for… … Wikipedia
Concept Search — A concept search (or conceptual search) is an automated information retrieval method that is used to search electronically stored unstructured text (for example, digital archives, email, scientific literature, etc.) for information that is… … Wikipedia