Studying strategies and types of players: experiments, logics and cognitive models

Synthese 195 (10):4265-4307 (2018)
  Copy   BIBTEX

Abstract

How do people reason about their opponent in turn-taking games? Often, people do not make the decisions that game theory would prescribe. We present a logic that can play a key role in understanding how people make their decisions, by delineating all plausible reasoning strategies in a systematic manner. This in turn makes it possible to construct a corresponding set of computational models in a cognitive architecture. These models can be run and fitted to the participants’ data in terms of decisions, response times, and answers to questions. We validate these claims on the basis of an earlier game-theoretic experiment about the turn-taking game “Marble Drop with Surprising Opponent”, in which the opponent often starts with a seemingly irrational move. We explore two ways of segregating the participants into reasonable “player types”. The first way is based on latent class analysis, which divides the players into three classes according to their first decisions in the game: Random players, Learners, and Expected players, who make decisions consistent with forward induction. The second way is based on participants’ answers to a question about their opponent, classified according to levels of theory of mind: zero-order, first-order and second-order. It turns out that increasing levels of decisions and theory of mind both correspond to increasing success as measured by monetary awards and increasing decision times. Next, we use the logical language to express different kinds of strategies that people apply when reasoning about their opponent and making decisions in turn-taking games, as well as the ‘reasoning types’ reflected in their behavior. Then, we translate the logical formulas into computational cognitive models in the PRIMs architecture. Finally, we run two of the resulting models, corresponding to the strategy of only being interested in one’s own payoff and to the myopic strategy, in which one can only look ahead to a limited number of nodes. It turns out that the participant data fit to the own-payoff strategy, not the myopic one. The article closes the circle from experiments via logic and cognitive modelling back to predictions about new experiments.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 76,346

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Mating strategies as game theory: Changing rules?Linda Mealey - 2000 - Behavioral and Brain Sciences 23 (4):613-613.
Learning to apply theory of mind.Rineke Verbrugge & Lisette Mol - 2008 - Journal of Logic, Language and Information 17 (4):489-511.
On Loss Aversion in Bimatrix Games.Bram Driesen, Andrés Perea & Hans Peters - 2010 - Theory and Decision 68 (4):367-391.

Analytics

Added to PP
2017-04-20

Downloads
17 (#641,389)

6 months
1 (#450,993)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Tractability and the computational mind.Rineke Verbrugge & Jakub Szymanik - 2018 - In Mark Sprevak & Matteo Colombo (eds.), The Routledge Handbook of the Computational Mind. Oxford, UK: pp. 339-353.

Add more citations