A Satisficing Strategy with Variable Reference in the Multi-armed Bandit Problems

被引:0
|
作者
Kohno, Yu [1 ]
Takahashi, Tatsuji [2 ]
机构
[1] Tokyo Denki Univ, Grad Sch Adv Sci & Technol, Hiki, Saitama 3500394, Japan
[2] Tokyo Denki Univ, Hiki, Saitama 3500394, Japan
关键词
Symmetric reasoning; decision-making; N armed bandit problem; speed-accuracy trade-off;
D O I
10.1063/1.4912815
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The loosely symmetric model (LS) is as a subjective probability model that came from human beings' cognitive characteristics. To suggest a value to apply human beings' cognitive characteristics, we developed a value function "loosely symmetric model with variable reference" (LS-aVR) that expanded LS in the decision-amaking. It is important how get a reference value having an agent from environment to determine whether an algorithm using LS-aVR explores in comparison with a reference value. In this study, we proposed using statistical knowledge in an online method to acquire a reference value. Therefore we succeeded in making the result that new method exceeded a superior existing model in the multi-aarmed banded problem that is a kind of decision-amaking problems.
引用
收藏
页数:4
相关论文
共 50 条
  • [1] Satisficing in Multi-Armed Bandit Problems
    Reverdy, Paul
    Srivastava, Vaibhav
    Leonard, Naomi Ehrich
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2017, 62 (08) : 3788 - 3803
  • [3] An asymptotically optimal strategy for constrained multi-armed bandit problems
    Hyeong Soo Chang
    Mathematical Methods of Operations Research, 2020, 91 : 545 - 557
  • [4] Multi-objective multi-armed bandit with lexicographically ordered and satisficing objectives
    Alihan Hüyük
    Cem Tekin
    Machine Learning, 2021, 110 : 1233 - 1266
  • [5] Multi-objective multi-armed bandit with lexicographically ordered and satisficing objectives
    Huyuk, Alihan
    Tekin, Cem
    MACHINE LEARNING, 2021, 110 (06) : 1233 - 1266
  • [6] A Multi-Armed Bandit Strategy for Countermeasure Selection
    Cochrane, Madeleine
    Hunjet, Robert
    2020 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (SSCI), 2020, : 2510 - 2515
  • [7] Anytime Algorithms for Multi-Armed Bandit Problems
    Kleinberg, Robert
    PROCEEDINGS OF THE SEVENTHEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2006, : 928 - 936
  • [8] Percentile optimization in multi-armed bandit problems
    Ghatrani, Zahra
    Ghate, Archis
    ANNALS OF OPERATIONS RESEARCH, 2024, 340 (2-3) : 837 - 862
  • [9] Ambiguity aversion in multi-armed bandit problems
    Anderson, Christopher M.
    THEORY AND DECISION, 2012, 72 (01) : 15 - 33
  • [10] Multi-armed Bandit Problems with Strategic Arms
    Braverman, Mark
    Mao, Jieming
    Schneider, Jon
    Weinberg, S. Matthew
    CONFERENCE ON LEARNING THEORY, VOL 99, 2019, 99