Related papers: The Chaos Game on a General Iterated Function Syst…
We investigate combinatorial issues relating to the use of random orbit approximations to the attractor of an iterated function system with the aim of clarifying the role of the stochastic process during generation the orbit. A Baire…
Every quasi-attractor of an iterated function system (IFS) of continuous functions on a first-countable Hausdorff topological space is renderable by the probabilistic chaos game. By contrast, we prove that the backward minimality is a…
A simple class of chaotic systems in a random environment is considered and the fluctuation theorem is extended under the assumption of reversibility.
Game theory is the standard tool used to model strategic interactions in evolutionary biology and social science. Traditional game theory studies the equilibria of simple games. But is traditional game theory applicable if the game is…
We give a systematic account of iterated function systems (IFS) of weak contractions of different types (Browder, Rakotch, topological). We show that the existence of attractors and asymptotically stable invariant measures, and the validity…
We explore the chaos game for the continuous IFSs on topological spaces. We prove that the existence of attractor allows us to use the chaos game for visualization of attractor. The essential role of basin of attraction is also discussed.
The chaotic hypothesis discussed in [GC1] is tested experimentally in a simple conduction model. Besides a confirmation of the hypothesis predictions the results suggest the validity of the hypothesis in the much wider context in which, as…
The chaotic hypothesis has several implications which have generated interest in the literature because of their generality and because a few exact predictions are among them. However its application to Physics problems requires attention…
We study adaptive learning in a typical p-player game. The payoffs of the games are randomly generated and then held fixed. The strategies of the players evolve through time as the players learn. The trajectories in the strategy space…
This paper introduces a new notion of chaotic algorithms. These algorithms are iterative and are based on so-called chaotic iterations. Contrary to all existing studies on chaotic iterations, we are not interested in stable states of such…
Fixed point iterations are known to generate chaos, for some values in their parameter range. It is an established fact that Turing Machines are fixed point iterations. However, as these Machines operate in integer space, the standard…
A notion of incentive for agents is introduced which leads to a very general notion of an equilibrium for a finite game. Sufficient conditions for the existence of these equilibria are given. Known existence theorems are shown to be…
A chaotic system under periodic forcing can develop a periodically visited strange attractor. We discuss simple models in which the phenomenon, quite easy to see in numerical simulations, can be completely studied analytically.
The aim of this paper is to provide a different perspective in the study of the rate of convergence of the chaos game algorithm to the attractor of an iterated function system. We prove that for any function $\psi$ with $\lim\limits_{\ve\to…
Machine learning processes, e.g. ''learning in games'', can be viewed as non-linear dynamical systems. In general, such systems exhibit a wide spectrum of behaviors, ranging from stability/recurrence to the undesirable phenomena of chaos…
We give an algorithm for solving stochastic parity games with almost-sure winning conditions on {\it lossy channel systems}, under the constraint that both players are restricted to finite-memory strategies. First, we describe a general…
In this paper, we introduce a couple of dynamical systems that are related to the Chaos Game. We begin by discussing different methods of generating the Sierpinski gasket. Then we show how the transition from random to uniform selection…
This paper has two central aims: first, to provide simple conditions under which the generalized games in choice form and, consequently, the abstract economies, admit equilibrium; second, to study the solvability of several types of systems…
Recent theories from complexity science argue that complex dynamics are ubiquitous in social and economic systems. These claims emerge from the analysis of individually simple agents whose collective behavior is surprisingly complicated.…
We study the attractor of Iterated Function Systems composed of infinitely many affine, homogeneous maps. In the special case of second generation IFS, defined herein, we conjecture that the attractor consists of a finite number of…