Match!
Iris van de Pol
University of Amsterdam
4Publications
2H-index
6Citations
Publications 4
Newest
#1Valerio Capraro (Lond: University of London)H-Index: 15
#2Glorianna Jagfeld (University of Stuttgart)H-Index: 1
Last.Iris van de Pol (UvA: University of Amsterdam)H-Index: 2
view all 0 authors...
The conflict between pro-self and pro-social behaviour is at the core of many key problems of our time, as, for example, the reduction of air pollution and the redistribution of scarce resources. For the well-being of our societies, it is thus crucial to find mechanisms to promote pro-social choices over egoistic ones. Particularly important, because cheap and easy to implement, are those mechanisms that can change people’s behaviour without forbidding any options or significantly changing their...
#1Iris van de Pol (UvA: University of Amsterdam)H-Index: 2
#2I.J.E.I. van Rooij (Radboud University Nijmegen)H-Index: 19
Last.Jakub Szymanik (UvA: University of Amsterdam)H-Index: 10
view all 3 authors...
Theory of mind refers to the human capacity for reasoning about others’ mental states based on observations of their actions and unfolding events. This type of reasoning is notorious in the cognitive science literature for its presumed computational intractability. A possible reason could be that it may involve higher-order thinking (e.g., ‘you believe that I believe that you believe’). To investigate this we formalize theory of mind reasoning as updating of beliefs about beliefs using dynamic e...
#1Iris van de Pol (UvA: University of Amsterdam)H-Index: 2
#2I.J.E.I. van Rooij (Radboud University Nijmegen)H-Index: 19
Last.Jakub Szymanik (UvA: University of Amsterdam)H-Index: 10
view all 3 authors...
In this paper we introduce a computational-level model of theory of mind (ToM) based on dynamic epistemic logic (DEL), and we analyze its computational complexity. The model is a special case of DEL model checking. We provide a parameterized complexity analysis, considering several aspects of DEL (e.g., number of agents, size of preconditions, etc.) as parameters. We show that model checking for DEL is PSPACE-hard, also when restricted to single-pointed models and S5 relations, thereby solving a...
1