Method For Numerical Investigation Game Theory
Method For Numerical Investigation Game Theory
Introduction
It is characterized as a method for numerical investigation of irreconcilable situations to achieve the
most ideal basic leadership alternatives in light of the current situation given to get the ideal
outcomes. Its applications in numerous fields of sociology, just as in logic and software engineering.
In the beginning, it was handled zero-sum games, in which one person's gains result in losses for the
other entrant. Nowadays, game theory applies to a wide domain of behavioral relations, and is no a
way for the science of logical decision-making in humans, and computers. John von Neumann and
John Nash, as well as economist Oskar Morgenstern, are the pioneers of the game theory.
History
There is talk that the beginning (theory of the game) began at the hands of the Jews in the
Babylonian Talmud (0 - 500 AD). And also, some writings by some people such as James
Waldegrave (1713 AD) in his letter to Pierre-Remond de Montmort, which he sent to Nicolas Bernoulli
accompanied by a discussion of what James Waldegrave wrote. Augustin Cournot’s (Researches into
the Mathematical Principles of the Theory of Wealth) (1838 AD) which is a limited version of the Nash
equilibrium. And also, the book of Francis Yessidro Edgorth (1881 AD), an article on the application of
mathematics in moral sciences. The theory of Zermelo (1913 AD) is the first theory of game theory
published by E. Zermelo in his paper (Uber eine Anwendung der Mengenlehre auf die Theorie des
Schachspiels) which spoke about strategies for chess. Game theory was no longer an independent
scientific field until John von Neumann (1944) and Oskar Morgenstern published their Theory of
Games and Economic Behavior, which contributed to making game theory an area of independent
study. John Nash gives us a big contribution in four papers between (1950-53). first two papers, he
makes balance points N- Person Games and non-cooperative games, and these two papers are
known to us as the Nash equilibrium. proposed Nash in Nash equilibrium the study of cooperative
games via their reduction to non-cooperative form. he founded axiomatic bargaining theory in his
other two papers the Bargaining Problem and Two-Person Cooperative Games. proved the existence
of the Nash bargaining solution and provided the first execution of the Nash equilibrium. Near the end
of this decade (Late 50's) came the first studies of repeated games. The main outcome to show at this
time was the Folk Theorem. This states that the equilibrium results in an infinitely reiterated game
concur with the practical and strongly individually rational results of the one-shot game on which it is
based. synthesis of the theorem is obscure. (1988) Drew Fudenberg and David Kreps's A Theory of
Learning, Experimentation, and Equilibria, which attack the learning problem (how agents learn the
equilibrium) of the Nash equilibrium.
Game types
The game theory distinguishes between several forms of games, depending on the number of players
and the conditions of the game itself. Cooperative / Non-cooperative Solitaire is an individual game,
where there is no real conflict of interest because the only interest here is the individual's own
interest. In this game, luck or chance is the basic structure of the game, depending on the mixing of
the cards and on what the player has of good papers distributed randomly. Although probability theory
is concerned with individual games, it is not one of the favorite subjects in game theory, since there is
no opponent who adopts an independent approach that competes with the options of the other player.
Symmetric / Asymmetric In the theory of games, we tell a game what it is a symmetrical game when
it comes out playing a particular strategy depends only on other strategies used, not on who plays
out. If it is possible to change the players' identity without changing the exit strategies, the game is
symmetrical. Parity can be achieved in different varieties. Zero-sum / Non-zero-sum If the total profit-
output at the end of the game is zero, the game is zero-sum, and in these games, the amount or
probability of the profit is exactly equal to the amount or probability of the loss, which is equivalent to
the term economic parity analysis which expresses access to the point of loss and no loss or no
production And no depreciation. In 1944, Von Neumann and Oskar Morgensten showed that a total
zero-sum person could be expanded to an N +1 person in a zero-sum game, so the N + 1 games
could be generalized from the special case of zero-sum binary games. One of the most important
issues raised in this area is that the principles of maximization and reduction apply to all zero-sum
binary games. This term is known as the reduction-maximization problem. It was proven by Newman
in 1928, and others proved to be multi-layered.