Related papers: Optimizing Wealth by a Game within Cellular Automa…
Cellular automata (CA) captivate researchers due to teh emergent, complex individualized behavior that simple global rules of interaction enact. Recent advances in the field have combined CA with convolutional neural networks to achieve…
Cellular automata (CA) is an important modelling paradigm for complex systems. In the design of cellular automata, the most difficult task is to find the transformation rules that describe the temporal evolution or pattern of a modelled…
A cellular automaton in which cells represent agents playing the Prisoner's Dilemma (PD) game following the simple "win-stay, loose-shift" strategy is studied. Individuals with binary behavior, such as they can either cooperate (C) or…
Conway's Game of Life is the best-known cellular automaton. It is a classic model of emergence and self-organization, it is Turing-complete, and it can simulate a universal constructor. The Game of Life belongs to the set of semi-totalistic…
In this work we consider an agent based model in order to study the wealth distribution problem where the interchange is determined with a symmetric zero sum game. Simultaneously, the agents update their way of play trying to learn the…
Cellular automata are capable of developing complex behaviors based on simple local interactions between their elements. Some of these characteristics have been used to propose and improve meta-heuristics for global optimization; however,…
The basis for most of the ideas mentioned in this paper is the theory of cellular automata. A cellular automata contains a regular grid of cells, with each cell having a pre-defined set of finite states. The initial state is determined at…
A Genetic Algorithm (GA) is proposed in which each member of the population can change schemata only with its neighbors according to a rule. The rule methodology and the neighborhood structure employ elements from the Cellular Automata (CA)…
The Prisoner's Dilemma (PD) is one of the most popular games of the Game Theory due to the emergence of cooperation among competitive rational players. In this paper, we present the PD played in cells of one-dimension cellular automata,…
A Cellular Automata (CA) rule is presented that can generate "loop patterns" in a 2D grid under fixed boundary conditions. A loop is a cyclically closed path represented by one-cells enclosed by zero-cells. A loop pattern can contain…
A cellular game is a dynamical system in which cells, placed in some discrete structure, are regarded as playing a game with their immediate neighbors. Individual strategies may be either deterministic or stochastic. Strategy success is…
Cellular automata (CA) are dynamical systems defined by a finite local rule but they are studied for their global dynamics. They can exhibit a wide range of complex behaviours and a celebrated result is the existence of (intrinsically)…
Cellular automata are a set of computational models in discrete space that have a discrete time evolution defined by neighbourhood rules. They are used to simulate many complex systems in physics and science in general. In this work,…
We study optimal portfolio choice models in markets with partial information about the stock's drift. We solve the single agent problem for general utilities using a new approach that yields regularity of the value function and closed form…
Gambles are random variables that model possible changes in monetary wealth. Classic decision theory transforms money into utility through a utility function and defines the value of a gamble as the expectation value of utility changes.…
Purpose: We propose a model to present a possible mechanism for obtaining sizeable behavioural structures by simulating an agent based on the evolutionary public good game with available social learning. Methods: The model considered a…
We have proposed two new evolutionary rules on spatio-iterated games that is not mimic evolution of strategies, and mainly discussed the Prisoner's Dilemma game \cite{toyota2} by the two evoutionary rules \cite{toyota3}. In this paper we…
Layered Cellular Automata (LCA) extends the concept of traditional cellular automata (CA) to model complex systems and phenomena. In LCA, each cell's next state is determined by the interaction of two layers of computation, allowing for…
We created two dimensional hexagonal cellular automata to obtain complexity. Considering the game of life rules, Wolfram's works about life-like structures and John von Neumann's self-replication, self-maintenance, self-reproduction…
It is speculated that there is a relationship between 1/f noise and computational universality in cellular automata. We use genetic algorithms to search for one-dimensional and two-state, five-neighbor cellular automata which have 1/f-type…