A loser can be a winner: comparison of two instance-based learning models in a market entry competition (Q2344970)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A loser can be a winner: comparison of two instance-based learning models in a market entry competition
scientific article

    Statements

    A loser can be a winner: comparison of two instance-based learning models in a market entry competition (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 May 2015
    0 references
    Summary: This paper presents a case of parsimony and generalization in model comparisons. We submitted two versions of the same cognitive model to the Market Entry Competition (MEC), which involved four-person and two-alternative (enter or stay out) games. Our model was designed according to the Instance-Based Learning Theory (IBLT). The two versions of the model assumed the same cognitive principles of decision making and learning in the MEC. The only difference between the two models was the assumption of homogeneity among the four participants: one model assumed homogeneous participants (IBL-same) while the other model assumed heterogeneous participants (IBL-different). The IBL-same model involved three free parameters in total while the IBL-different involved 12 free parameters, i.e., three free parameters for each of the four participants. The IBL-different model outperformed the IBL-same model in the competition, but after exposing the models to a more challenging generalization test (the Technion Prediction Tournament), the IBL-same model outperformed the IBL-different model. Thus, a loser can be a winner depending on the generalization conditions used to compare models. We describe the models and the process by which we reach these conclusions.
    0 references
    0 references
    0 references
    0 references
    0 references
    instance-based learning theory
    0 references
    model comparison
    0 references
    generalization
    0 references
    parsimony
    0 references
    0 references