{'fraction_non_alphanumeric': 0.01827956989247312, 'fraction_numerical': 0.002150537634408602, 'mean_word_length': 5.206666666666667, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Computational Model of Second-Order Social Reasoning

This paper presents the first computational cognitive model of second-order social reasoning. The model uses a decision tree strategy to reason about the opponent's behavior. We hypothesize that a decision tree strategy requires (1) declarative memory, and (2) working memory. Declarative memory is required to retrieve successive reasoning steps, while working memory is required to temporarily store these reasoning steps while the next step is retrieved from memory. The model fit on data from a social reasoning game supports the validity of the model. This initial result leads to an explicit prediction for an experiment in which the reasoning game is combined with another task that requires the same cognitive resources as hypothesized by the model. This work is a first step towards understanding higher-order social reasoning from a cognitive modeling perspective.