Mark Blokpoel

dblp:175/9583 · DBLP profile ↗
← Back
12ranked-venue papers
3as first author
5since 2021 · last 2024
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 12 · 3 first-author · 5 since 2021Applied, interdisciplinary, general and emerging computing · 11 · 3 first-author · 5 since 2021
YearPublicationVenuePosition
2024 Challenges for a computational explanation of flexible linguistic inference
Marieke Woensdregt, Mark Blokpoel, Iris van Rooij, Andrea E. Martin
CogSci2
2022 Intractability of Bayesian belief-updating during communication
Laura van de Braak, Ronald de Haan, Iris van Rooij, Mark Blokpoel
CogSci4
2021 Computational challenges in explaining communication: How deep the rabbit hole goes
Laura van de Braak, Mark Dingemanse, Ivan Toni, Iris van Rooij, Mark Blokpoel
CogSci5
2021 Compositionality, modularity, and the architecture of the language faculty
Bob van Tiel, Mark Blokpoel, Iris van Rooij, Andrea E. Martin
CogSci2
2021 Why is scaling up models of language evolution hard?
Marieke Woensdregt, Matthew Spike, Ronald de Haan, Todd Wareham, Iris van Rooij, Mark Blokpoel
CogSci6
2020 Computational mechanisms for resolving misunderstandings
Laura van de Braak, Mark Blokpoel, Mark Dingemanse, Ivan Toni, Iris van Rooij
CogSci2
2020 A simple repair mechanism can alleviate computational demands of pragmatic reasoning: simulations and complexity analysis
abstract
How can people communicate successfully while keeping resource costs low in the face of ambiguity?We present a principled theoretical analysis comparing two strategies for disambiguation in communication: (i) pragmatic reasoning, where communicators reason about each other, and (ii) other-initiated repair, where communicators signal and resolve trouble interactively.Using agent-based simulations and computational complexity analyses, we compare the efficiency of these strategies in terms of communicative success, computation cost and interaction cost.We show that agents with a simple repair mechanism can increase efficiency, compared to pragmatic agents, by reducing their computational burden at the cost of longer interactions.We also find that efficiency is highly contingent on the mechanism, highlighting the importance of explicit formalisation and computational rigour.
Jacqueline van Arkel, Marieke Woensdregt, Mark Dingemanse, Mark Blokpoel
CoNLL4
2017 Mindshaping the world can make mindreading tractable: Bridging the gap between philosophy and computational complexity analysis
Andrea Zeppi, Mark Blokpoel
CogSci2
2015 Bridging the communicative gap between robots and humans, by analogy
Mark Blokpoel, Todd Wareham, Jan Peter de Ruiter, Pim Haselager, Ivan Toni, Iris van Rooij
CogSci1
2013 Modeling the genesis of a novel communicative system
Mark Blokpoel, Todd Wareham, Ivan Toni, Iris van Rooij
CogSci1
2013 Computational complexity analysis for cognitive scientists
Iris van Rooij, Johan Kwisthout, Mark Blokpoel, Todd Wareham
CogSci3
2011 The computational costs of recipient design and intention recognition in communication
Mark Blokpoel, Johan Kwisthout, Todd Wareham, Pim Haselager, Ivan Toni, Iris van Rooij
CogSci1