A choice prediction competition for market entry games: an introduction (Q2344932)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A choice prediction competition for market entry games: an introduction
scientific article

    Statements

    A choice prediction competition for market entry games: an introduction (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 May 2015
    0 references
    Summary: A choice prediction competition is organized that focuses on decisions from experience in market entry games (\url{http://sites.google.com/site/gpredcomp/} and \url{http://www.mdpi.com/si/games/predict-behavior/}). The competition is based on two experiments: An estimation experiment, and a competition experiment. The two experiments use the same methods and subject pool, and examine games randomly selected from the same distribution. The current introductory paper presents the results of the estimation experiment, and clarifies the descriptive value of several baseline models. The experimental results reveal the robustness of eight behavioral tendencies that were documented in previous studies of market entry games and individual decisions from experience. The best baseline model (I-SAW) assumes reliance on small samples of experiences, and strong inertia when the recent results are not surprising. The competition experiment will be run in May 2010 (after the completion of this introduction), but they will not be revealed until September. To participate in the competition, researchers are asked to E-mail the organizers models (implemented in computer programs) that read the incentive structure as input, and derive the predicted behavior as an output. The submitted models will be ranked based on their prediction error. The winners of the competition will be invited to publish a paper that describes their model.
    0 references
    0 references
    0 references
    0 references
    0 references
    reinforcement learning
    0 references
    excess entry
    0 references
    recency
    0 references
    surprise triggers change
    0 references
    inertia
    0 references
    0 references