Non-probabilistic decision making with memory constraints

被引：0
作者：
Vostroknutov, Alexander [1 ]
机构：
[1] Maastricht Univ, NL-6200 MD Maastricht, Netherlands
来源：
ECONOMICS LETTERS | 2012年 / 117卷 / 01期
关键词：
Adaptive learning; Constrained memory; Bandit problems; SIMPLE DYNAMIC-MODEL; CHOICE;
D O I：
10.1016/j.econlet.2012.06.004
中图分类号：
F [经济];
学科分类号：
02 ;
摘要：
The single decision maker chooses one of the actions repeatedly. She chooses the action with the highest weighted average of the past payoffs. In the long run either the action with highest expected payoff or the action with highest minimal payoff is chosen depending on how weights evolve. (C) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码：303 / 305
页数：3
相关论文
共 7 条
1