Markovian binary trees form a class of continuous-time branching processes where the lifetime and reproduction epochs of individuals are controlled by an underlying Markov process. An Expectation–Maximization (EM) algorithm is developed to estimate the parameters of the Markov process from the...

This paper introduces a non-parametric binary classification tree approach to inferring unobserved strategies from the observed actions of economic agents. The strategies are in the form of possibly nested if-then statements. We apply our approach to experimental data from the repeated ultimatum...

We infer unobserved strategies from the observed actions of buyers in posted-offer market experiments to evaluate their effectiveness against a monopolist. While the strategies of one-quarter of the buyers in our experiments correspond to the game-theoretic prediction of passive price-taking,...

This paper introduces a non-parametric binary classification tree approach to inferring unobserved strategies from the observed actions of economic agents. The strategies are in the form of possibly nested if-then statements. We apply our approach to experimental data from the repeated ultimatum...

We infer unobserved strategies from the observed actions of buyers in posted-offer market experiments to evaluate their effectiveness against a monopolist. While the strategies of one-quarter of the buyers in our experiments correspond to the game-theoretic prediction of passive price-taking,...