We consider how an epistemic network might self-assemble from the ritualization of the individual decisions of simple heterogeneous agents. In such evolved social networks, inquirers may be significantly more successful than they could be investigating nature on their own. The evolved network may also dramatically lower the epistemic risk faced by even the most talented inquirers. We consider networks that self-assemble in the context of both perfect and imperfect communication and compare the behaviour of inquirers in each. This provides a (...) step in bringing together two new and developing research programs, the theory of self-assembling games and the theory of network epistemology. (shrink)

We consider how cue-reading, sensory-manipulation, and signaling games may initially evolve from ritualized decisions and how more complex games may evolve from simpler games by polymerization, template transfer, and modular composition. Modular composition is a process that combines simpler games into more complex games. Template transfer, a process by which a game is appropriated to a context other than the one in which it initially evolved, is one mechanism for modular composition. And polymerization is a particularly salient example of modular (...) composition where simpler games evolve to form more complex chains. We also consider how the evolution of new capacities by modular composition may be more efficient than evolving those capacities from basic decisions. (shrink)

Skyrms, building on the work of Dretske, has recently developed a novel information-theoretic account of propositional content in simple signalling systems. Information-theoretic accounts of content traditionally struggle to accommodate the possibility of misrepresentation, and I show that Skyrms’s account is no exception. I proceed to argue, however, that a modified version of Skyrms’s account can overcome this problem. On my proposed account, the propositional content of a signal is determined not by the information that it actually carries, but by the (...) information that it would carry at the nearest separating equilibrium of the underlying evolutionary dynamics. I show that this amended account yields reasonable ascriptions of false propositional content in a well-known formal model of the evolution of communication , and close with a discussion of the serious but perhaps not insuperable difficulties we face in applying the account to examples of signalling in the real world. (shrink)

We study a low-rationality learning dynamics called probe and adjust. Our emphasis is on its properties in games of information transfer such as the Lewis signaling game or the Bala-Goyal network game. These games fall into the class of weakly better reply games, in which, starting from any action profile, there is a weakly better reply path to a strict Nash equilibrium. We prove that probe and adjust will be close to strict Nash equilibria in this class of games with (...) arbitrarily high probability. In addition, we compare these asymptotic properties to short-run behavior. (shrink)

‘Noise’ in this study, in the sense of evolutionary game theory, refers to deviations from prevailing behavioral rules. Analyzing data from a laboratory experiment on coordination in networks, we tested ‘what kind of noise’ is supported by behavioral evidence. This empirical analysis complements a growing theoretical literature on ‘how noise matters’ for equilibrium selection. We find that the vast majority of decisions constitute myopic best responses, but deviations continue to occur with probabilities that are sensitive to their costs, that is, (...) less frequent when implying larger payoff losses relative to the myopic best response. In addition, deviation rates vary with patterns of realized payoffs that are related to trial-and-error behavior. While there is little evidence that deviations are clustered in time or space, there is evidence of individual heterogeneity. (shrink)