Explaining Human Choice Probabilities with Simple Vector Representations
We formalize human choice behavior in a probabilistic hide-and-seek task. In our geometric construction, vectors represent participant choice frequencies as well as probability matching and maximizing strategies. We measured choice behavior not just in the well-studied scenario of pursuing an objective (seeking), but also the rarely studied scenario of avoiding consequences (hiding). We used our geometric construction to define the avoidance counterpart of probability matching, probability antimatching, as a vector reflection across the uniform distribution. Decomposing the behavior of participants when they were seeking into matching and maximizing components, we could mathematically derive the analogous antimatching and minimizing strategies for hiding. Participants did change their choice frequencies between hiding and seeking conditions. In both cases, we found that a linear combination of just two vectors did an excellent job of fitting participant choice frequencies: matching + maximizing for seeking, antimatching + minimizing for hiding. We could account for diversity in participant strategy usage by varying the coefficients of the two relevant basis strategy vectors. We successfully applied this model in scenarios of up to 7 rooms. We conclude that an apparent diversity of human conduct in stochastic environments can, in some cases, be explained by varying the weighting of two principle strategies: whether to match/antimatch or maximize/minimize.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Wardrop Equilibrium Can Be Boundedly Rational: A New Behavioral Theory of Route Choice
As one of the most fundamental concepts in transportation science, Wardrop equilibrium (WE) has always had a relatively weak behavioral underpinning. To strengthen this foundation, one must reckon with bounded rationalit…
Decision MakingDynamics of Human Cooperation in Economic Games
Human decision behaviour is quite diverse. In many games humans on average do not achieve maximal payoff and the behaviour of individual players remains inhomogeneous even after playing many rounds. For instance, in repe…
Parameter identification in Markov chain choice models
This work studies the parameter identification problem for the Markov chain choice model of Blanchet, Gallego, and Goyal used in assortment planning. In this model, the product selected by a customer is determined by a M…
On Estimating Multi-Attribute Choice Preferences using Private Signals and Matrix Factorization
Revealed preference theory studies the possibility of modeling an agent's revealed preferences and the construction of a consistent utility function. However, modeling agent's choices over preference orderings is not alw…
AttributeRanking Facts for Explaining Answers to Elementary Science Questions
In multiple-choice exams, students select one answer from among typically four choices and can explain why they made that particular choice. Students are good at understanding natural language questions and based on thei…
Interpretable Machine LearningLearning-To-RankMultiple-choiceQuestion Answering+3