The purpose of this research is to study how genetic algorithms (GA's) are applied in the field of Game Theory. GA's are effective approaches for machine learning and optimization problems. In this work, genetic algorithm is utilized to determine the behavior of an opponent in Prisoners’ Dilemma. The opponent behavior will be modeled by means of adaptive automaton. The basic problem of this stu...

We present a novel formulation of quantum game theory based on the Schmidt decomposition, which has the merit that the entanglement of quantum strategies is manifestly quantified. We apply this formulation to 2-player, 2-strategy symmetric games and obtain a complete set of quantum Nash equilibria. Apart from those available with the maximal entanglement, these quantum Nash equilibria are exten...

We propose a bargaining process as a way of playing and solving non cooperative games. We focus on social dilemma situations and show that sequential proposals which, if confirmed by players, determine real play, may give rise to equilibrium outcomes which differ from the standard non cooperative solution. Specifically, we show that, under standard assumptions, in a prisoners’ dilemma with conf...

It took the European Union (EU) 35 years to achieve a co-operative agreement on co-ordinated measures of savings taxation. Political science has offered two explanations for this. First, co-operation is difficult to achieve as a resuIt of heterogeneity. Countries with a small domestic tax base favor tax competition, while coulltries with a large tax base prefer tax co-operation. Second, co-oper...

This article explores office market system dynamics through a simple simulation model. Model lag and adjustment parameters similar to real office markets generate explosive cycles. Simulations show that deviations from equilibrium can be reduced by changing the information structure of the system. System dynamics, principle /agent conflicts, a prisoners’ dilemma game, faulty information (poor f...

A bs t ra ct . A system is descr ibed in which a number of art ificial agents (represented by simple mathematical expressions) compe te for t he right to "re produce" (that is, to cause new agents with similar properties to be genera ted). By simulat ing some of the essential features of biological evolution, the system makes possible some novel insights into the behavior of communi ties of age...

* I want to thank Hans Haller and Mark Stegeman for their valuable suggestions and support. The paper benefited from the comments of participants in the 1997 SITE Summer Workshop. Abstract We consider a population of players playing a Prisoners' Dilemma Game in a local interaction setting, using a formalism of automata networks. Sufficient conditions for existence of an equilibrium where cooper...

In the context of an infinitely repeated Prisoners’ Dilemma, we explore how cooperation is initiated when players signal and coordinate through their actions. There are two types of players patient and impatient and a player’s type is private information. An impatient type is incapable of cooperative play, while if both players are patient types and this is common knowledge then they can cooper...

Using a symmetric 2-person prisoners’ dilemma as the base game, each player receives a signal for the number of rounds to be played with the same partner. The actual number of rounds (the length of the supergame) is determined by the maximal signal where each player expects the other’s signal to be smaller, respectively larger, by a fixed number of rounds with 50% probability. In the tradition ...