Indicators of the reliability of informants are essential for social learning in a society that is initially dominated by ignorance or superstition. Such reliability indicators should be based on meta-induction over records of truth-success. This is the major claim of this paper, and it is supported in two steps. One needs a non-circular justification of the method of meta-induction, as compared to other learning methods. An approach to this problem has been developed in earlier papers and is reported in section (...) 2. It is based on the predictive optimality of meta-inductive learning, under the assumption that objective success records are globally available. The rest of the paper develops an extension of this approach, so-called local meta-induction. Here individuals can access only success records of individuals in their immediate epistemic neighborhood. It is shown that local meta-inductive learning can spread reliable information over the entire population, and has clear advantages compared to success-independent social learning methods such as peer-imitation and authority-imitation.Send article to KindleTo send this article to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle. Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply. Find out more about the Kindle Personal Document Service.META-INDUCTION IN EPISTEMIC NETWORKS AND THE SOCIAL SPREAD OF KNOWLEDGEVolume 9, Issue 2Gerhard SchurzDOI: https://doi.org/10.1017/epi.2012.6Your Kindle email address Please provide your Kindle [email protected]@kindle.com Available formats PDF Please select a format to send. By using this service, you agree that you will only keep articles for personal use, and will not openly distribute them via Dropbox, Google Drive or other file sharing services. Please confirm that you accept the terms of use. Cancel Send ×Send article to Dropbox To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about sending content to Dropbox. META-INDUCTION IN EPISTEMIC NETWORKS AND THE SOCIAL SPREAD OF KNOWLEDGEVolume 9, Issue 2Gerhard SchurzDOI: https://doi.org/10.1017/epi.2012.6Available formats PDF Please select a format to send. By using this service, you agree that you will only keep articles for personal use, and will not openly distribute them via Dropbox, Google Drive or other file sharing services. Please confirm that you accept the terms of use. Cancel Send ×Send article to Google Drive To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about sending content to Google Drive. META-INDUCTION IN EPISTEMIC NETWORKS AND THE SOCIAL SPREAD OF KNOWLEDGEVolume 9, Issue 2Gerhard SchurzDOI: https://doi.org/10.1017/epi.2012.6Available formats PDF Please select a format to send. By using this service, you agree that you will only keep articles for personal use, and will not openly distribute them via Dropbox, Google Drive or other file sharing services. Please confirm that you accept the terms of use. Cancel Send ×Export citation Request permission. (shrink)

Philosophers of science have often favoured reductive approaches to how-possibly explanation. This article identifies three alternative conceptions making how-possibly explanation an interesting phenomenon in its own right. The first variety approaches “how possibly X?” by showing that X is not epistemically impossible. This can sometimes be achieved by removing misunderstandings concerning the implications of one’s current belief system but involves characteristically a modification of this belief system so that acceptance of X does not result in contradiction. The second variety offers (...) a potential how-explanation of X. It is usually followed by a range of further potential how-explanations of the same phenomenon. In recent literature the factual claims implied by the second variety have been downplayed whereas the heuristic role of mapping the space of conceptual possibilities has been emphasized. I will focus especially on this truth-bracketing sense of potentiality when looking closer at the second variety in the paper. The third variety has attracted less interest. It presents a partial how-explanation of X. Typically it aims to establish the existence of a mechanism by which X could be and was generated. The third conception stands out as the natural alternative for the advocate of ontic how-possibly explanations. This article transfers Salmon’s view that explanation-concepts can be broadly divided into epistemic, modal, and ontic to the context of how-possibly explanations. Moreover, it is argued that each of the three above-mentioned varieties of how-possibly explanation occurs in science. To recognize this may be especially relevant for philosophers. We are often misled by the promises of various why-explanation accounts, and seem to have forgotten nearly everything about the diversity of how-possibly explanations. (shrink)

Modeling and computer simulations, we claim, should be considered core philosophical methods. More precisely, we will defend two theses. First, philosophers should use simulations for many of the same reasons we currently use thought experiments. In fact, simulations are superior to thought experiments in achieving some philosophical goals. Second, devising and coding computational models instill good philosophical habits of mind. Throughout the paper, we respond to the often implicit objection that computer modeling is “not philosophical.”.

Deliberation is a standard procedure to make decisions in not too large groups. It has the advantage that the group members can learn from each other and that, at the end, often a consensus emerges that everybody endorses. But a deliberation procedure also has a number of disadvantages. E.g., what consensus is reached usually depends on the order in which the different group members speak. More specifically, the group member who speaks first often has an unproportionally high impact on the (...) final decision: She anchors the deliberation process. While the anchoring effect undoubtably appears in real deliberating groups, we ask whether it also appears in groups whose members are truth-seeking and rational in the sense that they take the information provided by their fellow group members properly into account by updating their beliefs according to plausible rules. To answer this question and to make some progress towards explaining the anchoring effect, a formal model is constructed and analyzed. Using this model, we study the anchoring effect in homogenous groups, for which we provide analytical results, and in inhomogeneous groups, for which we provide simulation results. (shrink)

We represent consensus formation processes based on iterated opinion pooling as a dynamic approach to common knowledge of posteriors :1236–1239, 1976; Geanakoplos and Polemarchakis in J Econ Theory 28:192–200, 1982). We thus provide a concrete and plausible Bayesian rationalization of consensus through iterated pooling. The link clarifies the conditions under which iterated pooling can be rationalized from a Bayesian perspective, and offers an understanding of iterated pooling in terms of higher-order beliefs.

Meta-induction, in its various forms, is an imitative prediction method, where the prediction methods and the predictions of other agents are imitated to the extent that those methods or agents have proven successful in the past. In past work, Schurz demonstrated the optimality of meta-induction as a method for predicting unknown events and quantities. However, much recent discussion, along with formal and empirical work, on the Wisdom of Crowds has extolled the virtue of diverse and independent judgment as essential to (...) maintenance of 'wise crowds'. This suggests that meta-inductive prediction methods could undermine the wisdom of the crowd inasmuch these methods recommend that agents imitate the predictions of other agents. In this article, we evaluate meta-inductive methods with a focus on the impact on a group's performance that may result from including meta-inductivists among its members. In addition to considering cases of global accessibility (i.e., cases where the judgments of all members of the group are available to all of the group's members), we consider cases where agents only have access to the judgments of other agents within their own local neighborhoods. (shrink)

It is widely believed that bringing parties with differing opinions together to discuss their differences will help both in securing consensus and also in ensuring that this consensus closely approximates the truth. This paper investigates this presumption using two mathematical and computer simulation models. Ultimately, these models show that increased contact can be useful in securing both consensus and truth, but it is not always beneficial in this way. This suggests one should not, without qualification, support policies which increase interpersonal (...) contact if one seeks to improve the epistemic performance of groups. (shrink)

This essay addresses the methodology of philosophy of science and illustrates how formal and empirical methods can be fruitfully combined. Special emphasis is given to the application of experimental methods to confirmation theory and to recent work on the conjunction fallacy, a key topic in the rationality debate arising from research in cognitive psychology. Several other issue can be studied in this way. In the concluding section, a brief outline is provided of three further examples.

There is a plurality of formal constraints for aggregating probabilities of a group of individuals. Different constraints characterise different families of aggregation rules. In this paper, we focus on the families of linear and geometric opinion pooling rules which consist in linear, respectively, geometric weighted averaging of the individuals’ probabilities. For these families, it is debated which weights exactly are to be chosen. By applying the results of the theory of meta-induction, we want to provide a general rationale, namely, optimality, (...) for choosing the weights in a success-based way by scoring rules. A major argument put forward against weighting by scoring is that these weights heavily depend on the chosen scoring rule. However, as we will show, the main condition for the optimality of meta-inductive weights is so general that it holds under most standard scoring rules, more precisely under all scoring rules that are based on a convex loss function. Therefore, whereas the exact choice of a scoring rule for weighted probability aggregation might depend on the respective purpose of such an aggregation, the epistemic rationale behind such a choice is generally valid. (shrink)

The paper defends the thesis that institutional virtue is properly modeled as a ‘‘consensual’’ property, along the lines of the Lehrer–Wagner model of consensus (LWC). In a first step, I argue that institutional virtue is not exhausted by duty-fulfilling, since institutions, contrary to natural individuals, are designed to fulfill duties. To avoid the charge of vacuity, virtue, if attributed to institutions, must be able to motivate supererogatory action. In a second step, I argue against dis- continuity of institutional virtue with (...) individual virtue. Two main arguments for discontinuity of collective properties display serious shortcomings when applied to virtues of institutions. Given that motivation for supererogatory action is neither inferred from statutory duties nor accommodates a right of reprobation, modeling institutional virtue on collective rationality or explaining it in terms of joint com-mitment both prove problematic. In a third step, I argue that LWC has the explanatory potential to account for institutional virtue. Due to its main features,iteration and evaluation, it provides a non-trivial analysis of continuity and thereby satisfies basic constraints on the notion of genuine institutional virtue. (shrink)

There is a growing interest in the foundations as well as the application of imprecise probability in contemporary epistemology. This dissertation is concerned with the application. In particular, the research presented concerns ways in which imprecise probability, i.e. sets of probability measures, may helpfully address certain philosophical problems pertaining to rational belief. The issues I consider are disagreement among epistemic peers, complete ignorance, and inductive reasoning with imprecise priors. For each of these topics, it is assumed that belief can be (...) modeled with imprecise probability, and thus there is a non-classical solution to be given to each problem. I argue that this is the case for peer disagreement and complete ignorance. However, I discovered that the approach has its shortcomings, too, specifically in regard to inductive reasoning with imprecise priors. Nevertheless, the dissertation ultimately illustrates that imprecise probability as a model of rational belief has a lot of promise, but one should be aware of its limitations also. (shrink)

This paper applies the theory of networks to the problem of how agents should assign weights to other agents in the Lehrer-Wagner model for consensus formation. The Lehrer- Wagner theory of consensus is introduced, and the problem of weight assignment is highlighted as one of the open prob- lems for the theory. The paper argues that the application of the theory of networks to the Lehrer-Wagner model con- stitutes an interesting and fruitful option, among others, for the problem of weight (...) assignment. (shrink)