Procedural justifications of democracy emphasize inclusiveness and respect and by doing so come into conflict with instrumental justifications that depend on voters’ competence. This conflict raises questions about jury theorems and makes their standing in democratic theory contested. We show that a type of no-regret learning called meta-induction can help to satisfy the competence assumption without excluding voters or diverse opinion leaders on an a priori basis. Meta-induction assigns weights to opinion leaders based on their past predictive performance to determine (...) the level of their inclusion in recommendations for voters. The weighting minimizes the difference between the performance of meta-induction and the best opinion leader in hindsight. The difference represents the regret of meta-induction whose minimization ensures that the recommendations are optimal in supporting voters’ competence. Meta-induction has optimal truth-tracking properties that support voters’ competence even if it is targeted by mis/disinformation and should be considered a tool for supporting democracy in hyper-plurality. (shrink)

Philosophers have recently questioned the methodological status of agent-based modeling. Meanwhile, this methodology has been central to various studies of the COVID-19 pandemic. Few agent-based COVID-19 models are accessible to philosophers for inspection or experimentation. We make available a package for modeling the COVID-19 pandemic and similar pandemics and give an impression of what can be achieved with it. In particular, it is shown that by coupling an agent-based model to a standard optimizer we are able to identify strategies for (...) implementing non-pharmacological interventions that flexibly lower or raise social activity, depending on how the outbreak develops, while balancing various desiderata that cannot be fully satisfied together. The simulation outcomes to be presented testify to the power of agent-based modeling and thereby help to push back against the recent philosophical critique of this methodology. (shrink)

The bounded confidence model has become a popular tool for studying communities of epistemically interacting agents. The model makes the idealizing assumption that all agents always have access to all other agents’ belief states. We draw on resources from network epistemology to do away with this assumption. In the model to be proposed, we impose an explicit communication network on a community, due to which each agent has access to the beliefs of only a selection of other agents. A much-discussed (...) result from network epistemology shows that densely connected communication networks are not always preferable to sparser networks. The aim of this paper is to investigate whether there are any noteworthy network effects in a version of the bounded confidence model augmented with communication networks, and in particular whether the aforementioned result from network epistemology can be replicated in that version. (shrink)