Over recent decades, computer simulations have become a common tool among practitioners of the social sciences. They have been utilized to study such diverse phenomena as the integration and segregation of different racial groups, the emergence and evolution of friendship networks, the spread of gossip, fluctuations of housing prices in an area, the transmission of social norms, and many more. Philosophers of science and others interested in the methodological status of these studies have identified a number of distinctive virtues of the use of computer simulations. For instance, it has been generally appreciated that as simulations require the formulation of an explicit algorithm, they foster precision and clarity about whatever conceptual issues are involved in the study. The value of computer simulations as a heuristic tool for developing hypotheses, models, and theories has also been recognized, as has been the fact that they can serve as a substitute for real experiments. This is especially useful in the social domain, given that human beings cannot be freely manipulated at the discretion of the experimenter (for both points, see Hartmann 1996). However, the main virtue of computer simulations is generally believed to be that they are able to deal with the complexities that arise when many elements interact in a highly dynamic system and which often evade an exact formal analysis (see, e.g., Humphreys 1991).

This paper focuses on the question of how to resolve disagreement and uses the Lehrer-Wagner model as a formal tool for investigating consensual decision-making. The main result consists in a general definition of when agents treat each other as epistemic peers (Kelly 2005; Elga 2007), and a theorem vindicating the “equal weight view” to resolve disagreement among epistemic peers. We apply our findings to an analysis of the impact of social network structures on group deliberation processes, and we demonstrate their stability with the help of numerical simulations.

This paper develops a formal framework to model a process in which the formation of individual opinions is embedded in a deliberative exchange with others. The paper opts for a low-resolution modeling approach and abstracts away from most of the details of the social-epistemic process. Taking a bird's eye view allows us to analyze the chances for the truth to be found and broadly accepted under conditions of cognitive division of labour combined with a social exchange process. Cognitive division of labour means that only some individuals are active truth seekers, possibly with different capacities. Both mathematical tools and computer simulations are used to investigate the model. As an analytical result, the Funnel Theorem states that under rather weak conditions on the social process, a consensus on the truth will be reached if all individuals possess an arbitrarily small capacity to go for the truth. The Leading the pack Theorem states that under certain conditions even a single truth seeker may lead all individuals to the truth. Systematic simulations analyze how close agents can get to the truth depending upon the frequency of truth seekers, their capacities as truth seekers, the position of the truth (more to the extreme or more in the centre of an opinion space), and the willingness to take into account the opinions of others when exchanging and updating opinions.

In recent years, various computational models have been developed for studying the dynamics of belief formation in a population of epistemically interacting agents that try to determine the numerical value of a given parameter. Whereas in those models, agents’ belief states consist of single numerical beliefs, the present paper describes a model that equips agents with richer belief states containing many beliefs that, moreover, are logically interconnected. Correspondingly, the truth the agents are after is a theory (a set of sentences of a given language) rather than a numerical value. The agents epistemically interact with each other and also receive evidence in varying degrees of informativeness about the truth. We use computer simulations to study how fast and accurately such populations as wholes are able to approach the truth under differing combinations of settings of the key parameters of the model, such as the degree of informativeness of the evidence and the weight the agents give to the evidence.

At the very end of the 19th century, Gabriele Tarde wrote that all society was a product of imitation and innovation. This view regarding the development of society has, to a large extent, fallen out of favour, and especially so in those areas where the rational actor model looms large. I argue that this is unfortunate, as models of imitative learning, in some cases, agree better with what people actually do than more sophisticated models of learning. In this paper, I contrast the behaviour of imitative learning with two more sophisticated learning rules (one based on Bayesian updating, the other based on the Nash-Brown-von Neumann dynamics) in the context of social deliberation problems. I show for two social deliberation problems, the Centipede game and a simple Lewis sender-receiver game, that imitative learning provides better agreement with what people actually do, thus partially vindicating Tarde.

Journals regulate a significant portion of the communication between scientists. This paper devises an agent-based model of scientific practice and uses it to compare various strategies for selecting publications by journals. Surprisingly, it appears that the best selection method for journals is to publish relatively few papers and to select those papers it publishes at random from the available “above threshold” papers it receives. This strategy is most effective at maintaining an appropriate type of diversity that is needed to solve a particular type of scientific problem. This problem and the limitation of the model is discussed in detail.

The justification of induction is of central significance for cross-cultural social epistemology. Different ‘epistemological cultures’ do not only differ in their beliefs, but also in their belief-forming methods and evaluation standards. For an objective comparison of different methods and standards, one needs (meta-)induction over past successes. A notorious obstacle to the problem of justifying induction lies in the fact that the success of object-inductive prediction methods (i.e., methods applied at the level of events) can neither be shown to be universally reliable (Hume's insight) nor to be universally optimal. My proposal towards a solution of the problem of induction is meta-induction. The meta-inductivist applies the principle of induction to all competing prediction methods that are accessible to her. By means of mathematical analysis and computer simulations of prediction games I show that there exist meta-inductive prediction strategies whose success is universally optimal among all accessible prediction strategies, modulo a small short-run loss. The proposed justification of meta-induction is mathematically analytical. It implies, however, an a posteriori justification of object-induction based on the experiences in our world. In the final section I draw conclusions about the significance of meta-induction for the social spread of knowledge and the cultural evolution of cognition, and I relate my results to other simulation results which utilize meta-inductive learning mechanisms.

A comparison is made between some epistemological issues arising in computer networks and standard features of social epistemology. A definition of knowledge for computational devices is provided and the topics of nonconceptual content and testimony are discussed.