Behavior in a Dynamic Decision Problem: an Analysis of Experimental Evidence Using a Bayesian Type Classification Algorithm By
نویسندگان
چکیده
Different people may use different strategies, or decision rules, when solving complex decision problems. We provide a new Bayesian procedure for drawing inferences about the nature and number of decision rules present in a population, and use it to analyze the behaviors of laboratory subjects confronted with a difficult dynamic stochastic decision problem. Subjects practiced before playing for money. Based on money round decisions, our procedure classifies subjects into three types, which we label “Near Rational,” “Fatalist,” and “Confused.” There is clear evidence of continuity in subjects’ behaviors between the practice and money rounds: types who performed best in practice also tended to perform best when playing for money. However, the agreement between practice and money play is far from perfect. The divergences appear to be well explained by a combination of type switching (due to learning and/or increased effort in money play) and errors in our probabilistic type assignments.
منابع مشابه
An Iterative Decision Rule to minimize cost of Acceptance Sampling Plan in Machine Replacement Problem
In this paper, we presented an optimal iterative decision rule for minimizing total cost in designing a sampling plan for machine replacement problem using the approach of dynamic programming and Bayesian inferences. Cost of replacing the machine and cost of defectives produced by machine has been considered in model. Concept of control threshold policy has been applied for decision making. If ...
متن کاملBehavior in a Dynamic Decision Problem: An Analysis of Experimental Evidence Using a Bayesian Type Classification Algorithm*
It has been long recognized that different people may use different strategies, or decision rules, when playing games or dealing with other complex decision problems. We provide a new Bayesian procedure for drawing inferences about the nature and number of decision rules that are present in a population of agents. We apply our procedure to analyze the actual behavior of subjects who are confron...
متن کاملPredicting Twist Condition by Bayesian Classification and Decision Tree Techniques
Railway infrastructures are among the most important national assets of countries. Most of the annual budget of infrastructure managers are spent on repairing, improving and maintaining railways. The best repair method should consider all economic and technical aspects of the problem. In recent years, data analysis of maintenance records has contributed significantly for minimizing the costs. B...
متن کاملNegative Selection Based Data Classification with Flexible Boundaries
One of the most important artificial immune algorithms is negative selection algorithm, which is an anomaly detection and pattern recognition technique; however, recent research has shown the successful application of this algorithm in data classification. Most of the negative selection methods consider deterministic boundaries to distinguish between self and non-self-spaces. In this paper, two...
متن کاملIntroducing a new meta-heuristic algorithm based on See-See Partridge Chicks Optimization to solve dynamic optimization problems
The SSPCO (See-See Particle Chicks Optimization) is a type of swarm intelligence algorithm derived from the behavior of See-See Partridge. Although efficiency of this algorithm has been proven for solving static optimization problems, it has not yet been tested to solve dynamic optimization problems. Due to the nature of NP-Hard dynamic problems, this algorithm alone is not able to solve such o...
متن کامل