Properties of a job search problem on a partially observable Markov chain in a dynamic economy

被引:0
|
作者
Nakai, T [1 ]
机构
[1] Kyushu Univ, Fac Econ, Dept Econ Engn, Fukuoka 8128581, Japan
关键词
partially observable Markov chain; total positivity; job search problem;
D O I
10.1016/j.camwa.2005.11.019
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
This paper observes a job search problem on a partially observable Markov chain, which can be considered as an extension of a job search in a dynamic economy in [1]. This problem is formulated as the state changes according to a partially observable Markov chain, i.e., the current state cannot be observed but there exists some information regarding what a present state is. All information about the unobservable state are summarized by the probability distributions on the state space, and we employ the Bayes' theorem as a learning procedure. The total positivity of order two, or simply TP2, is a fundamental property to investigate sequential decision problems, and it also plays an important role in the Bayesian learning procedure for a partially observable Markov process. By using this property, we consider some relationships among prior and posterior information, and the optimal policy. We will also observe the probabilities to make a transition into each state after some additional transitions by employing the optimal policy. In the stock market, suppose that the states correspond to the business situation of one company and if there is a state designating the default, then the problem is what time the stocks are sold off before bankrupt, and the probability to become bankrupt will be also observed. (c) 2006 Elsevier Ltd. All rights reserved.
引用
收藏
页码:189 / 198
页数:10
相关论文
共 50 条
  • [31] Conditional Markov Chain Search for the Generalised Travelling Salesman Problem for Warehouse Order Picking
    Nalivajevs, Olegs
    Karapetyan, Daniel
    2019 11TH COMPUTER SCIENCE AND ELECTRONIC ENGINEERING (CEEC), 2019, : 75 - 78
  • [32] Development a Partially Observable Markov Decision Processes-based Intelligent Assistant for Power Grids using Monte Carlo Tree Search
    Tomin, Nikita V.
    Kurbatsky, Victor
    Negnevitsky, Michael
    PROCEEDINGS OF THE 10TH INTERNATIONAL SCIENTIFIC SYMPOSIUM ON ELECTRICAL POWER ENGINEERING (ELEKTROENERGETIKA 2019), 2019, : 389 - 393
  • [33] Dynamic output feedback of networked control systems with partially known Markov chain packet dropouts
    Mahmoud, Magdi S.
    Khan, Gulam Dastagir
    OPTIMAL CONTROL APPLICATIONS & METHODS, 2015, 36 (01): : 29 - 44
  • [34] A Dynamic Buffer Reservation Method Based on Markov Chain to Solve Deadlock Problem in Scheduling
    Han, Zhonghua
    Liu, Yuehan
    Shi, Haibo
    Tian, Xutian
    PROCEEDINGS OF THE 11TH INTERNATIONAL CONFERENCE ON MODELLING, IDENTIFICATION AND CONTROL (ICMIC2019), 2020, 582 : 1205 - 1213
  • [35] A Comparison of Variational and Markov Chain Monte Carlo Methods for Inference in Partially Observed Stochastic Dynamic Systems
    Yuan Shen
    Cedric Archambeau
    Dan Cornford
    Manfred Opper
    John Shawe-Taylor
    Remi Barillec
    Journal of Signal Processing Systems, 2010, 61 : 51 - 59
  • [36] A Comparison of Variational and Markov Chain Monte Carlo Methods for Inference in Partially Observed Stochastic Dynamic Systems
    Shen, Yuan
    Archambeau, Cedric
    Cornford, Dan
    Opper, Manfred
    Shawe-Taylor, John
    Barillec, Remi
    JOURNAL OF SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY, 2010, 61 (01): : 51 - 59
  • [37] Efficient search and responsiveness trade-offs in a Markov chain model of evolution in dynamic environments
    Menezes, Amor A.
    Kabamba, Pierre T.
    MATHEMATICAL BIOSCIENCES, 2016, 276 : 44 - 58
  • [38] Dynamic post-disaster debris clearance problem with re-positioning of clearance equipment items under partially observable information
    Sayarshad, Hamid R.
    Du, Xinpi
    Gao, H. Oliver
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2020, 138 : 352 - 372
  • [39] A clustering-based modified variable neighborhood search algorithm for a dynamic job shop scheduling problem
    Mohammad Amin Adibi
    Jamal Shahrabi
    The International Journal of Advanced Manufacturing Technology, 2014, 70 : 1955 - 1961
  • [40] A clustering-based modified variable neighborhood search algorithm for a dynamic job shop scheduling problem
    Shahrabi, J. (jamalshahrabi@aut.ac.ir), 1955, Springer London (70): : 9 - 12