3,724 research outputs found
Dynamics of Internal Models in Game Players
A new approach for the study of social games and communications is proposed.
Games are simulated between cognitive players who build the opponent's internal
model and decide their next strategy from predictions based on the model. In
this paper, internal models are constructed by the recurrent neural network
(RNN), and the iterated prisoner's dilemma game is performed. The RNN allows us
to express the internal model in a geometrical shape. The complicated
transients of actions are observed before the stable mutually defecting
equilibrium is reached. During the transients, the model shape also becomes
complicated and often experiences chaotic changes. These new chaotic dynamics
of internal models reflect the dynamical and high-dimensional rugged landscape
of the internal model space.Comment: 19 pages, 6 figure
Processes, Roles and Their Interactions
Taking an interaction network oriented perspective in informatics raises the
challenge to describe deterministic finite systems which take part in networks
of nondeterministic interactions. The traditional approach to describe
processes as stepwise executable activities which are not based on the
ordinarily nondeterministic interaction shows strong centralization tendencies.
As suggested in this article, viewing processes and their interactions as
complementary can circumvent these centralization tendencies.
The description of both, processes and their interactions is based on the
same building blocks, namely finite input output automata (or transducers).
Processes are viewed as finite systems that take part in multiple, ordinarily
nondeterministic interactions. The interactions between processes are described
as protocols.
The effects of communication between processes as well as the necessary
coordination of different interactions within a processes are both based on the
restriction of the transition relation of product automata. The channel based
outer coupling represents the causal relation between the output and the input
of different systems. The coordination condition based inner coupling
represents the causal relation between the input and output of a single system.
All steps are illustrated with the example of a network of resource
administration processes which is supposed to provide requesting user processes
exclusive access to a single resource.Comment: In Proceedings IWIGP 2012, arXiv:1202.422
Complex networks derived from cellular automata
We propose a method for deriving networks from one-dimensional binary
cellular automata. The derived networks are usually directed and have
structural properties corresponding to the dynamical behaviors of their
cellular automata. Network parameters, particularly the efficiency and the
degree distribution, show that the dependence of efficiency on the grid size is
characteristic and can be used to classify cellular automata and that derived
networks exhibit various degree distributions. In particular, a class IV rule
of Wolfram's classification produces a network having a scale-free
distribution.Comment: 10 pages, 8 figure
A guided tour of asynchronous cellular automata
Research on asynchronous cellular automata has received a great amount of
attention these last years and has turned to a thriving field. We survey the
recent research that has been carried out on this topic and present a wide
state of the art where computing and modelling issues are both represented.Comment: To appear in the Journal of Cellular Automat
Talking Nets: A Multi-Agent Connectionist Approach to Communication and Trust between Individuals
A multi-agent connectionist model is proposed that consists of a collection of individual recurrent networks that communicate with each other, and as such is a network of networks. The individual recurrent networks simulate the process of information uptake, integration and memorization within individual agents, while the communication of beliefs and opinions between agents is propagated along connections between the individual networks. A crucial aspect in belief updating based on information from other agents is the trust in the information provided. In the model, trust is determined by the consistency with the receiving agents’ existing beliefs, and results in changes of the connections between individual networks, called trust weights. Thus activation spreading and weight change between individual networks is analogous to standard connectionist processes, although trust weights take a specific function. Specifically, they lead to a selective propagation and thus filtering out of less reliable information, and they implement Grice’s (1975) maxims of quality and quantity in communication. The unique contribution of communicative mechanisms beyond intra-personal processing of individual networks was explored in simulations of key phenomena involving persuasive communication and polarization, lexical acquisition, spreading of stereotypes and rumors, and a lack of sharing unique information in group decisions
- …