Measuring tree complexity with response times

65 Pages Posted: 15 Oct 2019 Last revised: 18 Apr 2022

See all articles by Konrad Grabiszewski

Konrad Grabiszewski

HEC Paris in Qatar

Alex R. Horenstein

University of Miami - School of Business Administration - Department of Economics

Date Written: May 25, 2020

Abstract

Game-theoretic trees vary in complexity. This paper introduces the concept of graph-based complexity and relies on the subjects’ behavior to empirically derive a measure of tree complexity. Data comes from the mobile app Blues and Reds, designed specifically to conduct experiments. The sample consists of 6,637 subjects from 143 countries who play 27 different dynamic games. Based on subjects’ response times, we find that two measures – the average response time spent at the first round and the average total time spent solving the tree – are the best candidates for the empirical measure of tree complexity. We focus on two-person, finite, zero-sum dynamic games with perfect and complete information.

Keywords: tree, complexity, backward induction, experimental game theory, mobile experiment

JEL Classification: C72, C73, C80, C90

Suggested Citation

Grabiszewski, Konrad and Horenstein, Alex R., Measuring tree complexity with response times (May 25, 2020). University of Miami Business School Research Paper No. 3463988, Available at SSRN: https://ssrn.com/abstract=3463988 or http://dx.doi.org/10.2139/ssrn.3463988

Konrad Grabiszewski

HEC Paris in Qatar ( email )

Doha

Alex R. Horenstein (Contact Author)

University of Miami - School of Business Administration - Department of Economics ( email )

P.O. Box 248126
Coral Gables, FL 33124-6550
United States

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Downloads
74
Abstract Views
1,115
Rank
655,200
PlumX Metrics