Game theory is the study of strategic competition used in many branches of science. In general, a game is a match between two or more players and each wants to maximize his or her score. In a game, the player’s score depends on their strategies. The goal is to find the optimized decision, with regard to the payoff, in conformity with the rules of the game. This thesis considers the games with two players who know both their own and their rival’s payoff. However, they do not know the strategy chosen by the opponent.
In a classical game, the options of players are referred to as cooperation and defect. Quantum game theory is a generalization of classical game theory. In quantum games a linear combination of two options specify the strategy based on qubit. The quantum domain is characterized by entanglement. The quantum entanglement coefficient (y) varies from 0 to . The game is in the classical regime when y is smaller than a threshold. Quantum entanglement is intrinsically non-local.
In an iterated game tournament, 63 different strategies contest with four known strategies. Depending on the result, they are divided to a number of groups. The competition specifies which group of strategies can obtain a higher score.
Other types of games are discussed in the thesis. They are known as incomplete information games. In these games one player has two payoff matrixes, and the rival does not know which of them is used. We discuss the advantage of using quantum strategy over the classical game, particular in avoiding the dilemma in classical games.
| Identifer | oai:union.ndltd.org:auctr.edu/oai:digitalcommons.auctr.edu:dissertations-4082 |
| Date | 01 July 2015 |
| Creators | Razavi, Ahmad Kafaee |
| Publisher | DigitalCommons@Robert W. Woodruff Library, Atlanta University Center |
| Source Sets | Atlanta University Center |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | ETD Collection for AUC Robert W. Woodruff Library |
Page generated in 0.0025 seconds