当前位置: X-MOL 学术Math. Meth. Oper. Res. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Full-information best choice game with hint
Mathematical Methods of Operations Research ( IF 1.2 ) Pub Date : 2019-04-23 , DOI: 10.1007/s00186-019-00666-w
Marek Skarupski

In the classical full-information best choice problem a decision maker aims to select the best opportunity. His decision is based only on the exact values of the observed sequence. In this paper we consider two modifications of the above problem. We add a second player who can either propose additional information or block the observed object and demand an extortion. Our goal is to establish an optimal reward for the second player and the best moment to interrupt the decision process. The situation when the number of observations tends to reach infinity has been studied.

中文翻译:

带有提示的全信息最佳选择游戏

在经典的全信息最佳选择问题中,决策者旨在选择最佳机会。他的决定仅基于观察到的序列的精确值。在本文中,我们考虑上述问题的两种修改。我们增加了第二位玩家,他可以提出其他信息或阻止观察到的物体并要求勒索。我们的目标是为第二位玩家建立最佳奖励,并为中断决策过程提供最佳时机。研究了观察数趋于无穷大的情况。
更新日期:2019-04-23
down
wechat
bug