Logo
Unionpedia
Communication
Get it on Google Play
New! Download Unionpedia on your Android™ device!
Download
Faster access than browser!
 

Strategy (game theory)

Index Strategy (game theory)

In game theory, a player's strategy is any of the options he or she can choose in a setting where the outcome depends not only on his own actions but on the action of others. [1]

30 relations: Algorithm, Ariel Rubinstein, Auction, Bayesian game, Ben Polak, Coordination game, Econometrica, Evolutionarily stable strategy, Fair division, Game theory, Haven (graph theory), John Forbes Nash Jr., Kuhn's theorem, Matching pennies, Nash equilibrium, Normal-form game, Open Yale Courses, Player (game), Prisoner's dilemma, Probability, Purification theorem, Random number generation, Robot, Rock–paper–scissors, Sequential game, Software agent, Solution concept, Stag hunt, Trembling hand perfect equilibrium, Ultimatum game.

Algorithm

In mathematics and computer science, an algorithm is an unambiguous specification of how to solve a class of problems.

New!!: Strategy (game theory) and Algorithm · See more »

Ariel Rubinstein

Ariel Rubinstein (Hebrew: אריאל רובינשטיין) (born April 13, 1951) is an Israeli economist who works in Economic Theory, Game Theory and Bounded Rationality.

New!!: Strategy (game theory) and Ariel Rubinstein · See more »

Auction

An auction is a process of buying and selling goods or services by offering them up for bid, taking bids, and then selling the item to the highest bidder.

New!!: Strategy (game theory) and Auction · See more »

Bayesian game

In game theory, a Bayesian game is a game in which the players have incomplete information on the other players (e.g. on their available strategies or payoffs), but, they have beliefs with known probability distribution.

New!!: Strategy (game theory) and Bayesian game · See more »

Ben Polak

Benjamin "Ben" Polak (born 22 December 1961) is a British professor of economics and management and Provost at Yale University.

New!!: Strategy (game theory) and Ben Polak · See more »

Coordination game

In game theory, coordination games are a class of games with multiple pure strategy Nash equilibria in which players choose the same or corresponding strategies.

New!!: Strategy (game theory) and Coordination game · See more »

Econometrica

Econometrica is a peer-reviewed academic journal of economics, publishing articles in many areas of economics, especially econometrics.

New!!: Strategy (game theory) and Econometrica · See more »

Evolutionarily stable strategy

An evolutionarily stable strategy (ESS) is a strategy which, if adopted by a population in a given environment, cannot be invaded by any alternative strategy that is initially rare.

New!!: Strategy (game theory) and Evolutionarily stable strategy · See more »

Fair division

Fair division is the problem of dividing a set of goods or resources between several people who have an entitlement to them, such that each person receives his/her due share.

New!!: Strategy (game theory) and Fair division · See more »

Game theory

Game theory is "the study of mathematical models of conflict and cooperation between intelligent rational decision-makers".

New!!: Strategy (game theory) and Game theory · See more »

Haven (graph theory)

In graph theory, a haven is a certain type of function on sets of vertices in an undirected graph.

New!!: Strategy (game theory) and Haven (graph theory) · See more »

John Forbes Nash Jr.

John Forbes Nash Jr. (June 13, 1928 – May 23, 2015) was an American mathematician who made fundamental contributions to game theory, differential geometry, and the study of partial differential equations.

New!!: Strategy (game theory) and John Forbes Nash Jr. · See more »

Kuhn's theorem

In game theory, Kuhn's theorem relates perfect recall, mixed and unmixed strategies and their expected payoffs.

New!!: Strategy (game theory) and Kuhn's theorem · See more »

Matching pennies

Matching pennies is the name for a simple game used in game theory.

New!!: Strategy (game theory) and Matching pennies · See more »

Nash equilibrium

In game theory, the Nash equilibrium, named after American mathematician John Forbes Nash Jr., is a solution concept of a non-cooperative game involving two or more players in which each player is assumed to know the equilibrium strategies of the other players, and no player has anything to gain by changing only their own strategy.

New!!: Strategy (game theory) and Nash equilibrium · See more »

Normal-form game

In game theory, normal form is a description of a game.

New!!: Strategy (game theory) and Normal-form game · See more »

Open Yale Courses

Open Yale Courses is a project of Yale University to share full video and course materials from its undergraduate courses.

New!!: Strategy (game theory) and Open Yale Courses · See more »

Player (game)

A player of a game is a participant therein.

New!!: Strategy (game theory) and Player (game) · See more »

Prisoner's dilemma

The prisoner's dilemma is a standard example of a game analyzed in game theory that shows why two completely rational individuals might not cooperate, even if it appears that it is in their best interests to do so.

New!!: Strategy (game theory) and Prisoner's dilemma · See more »

Probability

Probability is the measure of the likelihood that an event will occur.

New!!: Strategy (game theory) and Probability · See more »

Purification theorem

In game theory, the purification theorem was contributed by Nobel laureate John Harsanyi in 1973.

New!!: Strategy (game theory) and Purification theorem · See more »

Random number generation

Random number generation is the generation of a sequence of numbers or symbols that cannot be reasonably predicted better than by a random chance, usually through a hardware random-number generator (RNG).

New!!: Strategy (game theory) and Random number generation · See more »

Robot

A robot is a machine—especially one programmable by a computer— capable of carrying out a complex series of actions automatically.

New!!: Strategy (game theory) and Robot · See more »

Rock–paper–scissors

Rock-paper-scissors (also known as scissors-paper-rock or other variants) is a hand game usually played between two people, in which each player simultaneously forms one of three shapes with an outstretched hand.

New!!: Strategy (game theory) and Rock–paper–scissors · See more »

Sequential game

In game theory, a sequential game is a game where one player chooses their action before the others choose theirs.

New!!: Strategy (game theory) and Sequential game · See more »

Software agent

In computer science, a software agent is a computer program that acts for a user or other program in a relationship of agency, which derives from the Latin agere (to do): an agreement to act on one's behalf.

New!!: Strategy (game theory) and Software agent · See more »

Solution concept

In game theory, a solution concept is a formal rule for predicting how a game will be played.

New!!: Strategy (game theory) and Solution concept · See more »

Stag hunt

In game theory, the stag hunt is a game that describes a conflict between safety and social cooperation.

New!!: Strategy (game theory) and Stag hunt · See more »

Trembling hand perfect equilibrium

In game theory, trembling hand perfect equilibrium is a refinement of Nash equilibrium due to Reinhard Selten.

New!!: Strategy (game theory) and Trembling hand perfect equilibrium · See more »

Ultimatum game

The ultimatum game is a game that has become a popular instrument of economic experiments.

New!!: Strategy (game theory) and Ultimatum game · See more »

Redirects here:

Mixed Strategy, Mixed Strategy Equilibria, Mixed strategies, Mixed strategy, Move (game theory), Pure strategies, Pure strategy, Strategia (teoria dei giochi), Strategy (in game theory), Strategy combination, Strategy profile, Strategy-combination, Totally mixed strategy.

References

[1] https://en.wikipedia.org/wiki/Strategy_(game_theory)

OutgoingIncoming
Hey! We are on Facebook now! »