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 条
  • [21] Automated Dynamic Planning and Execution for a Partially Observable Game Model: Tsunami City Search and Rescue
    Vaccaro, James
    Guest, Clark
    2008 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-8, 2008, : 3685 - +
  • [22] APPROXIMATIONS OF DYNAMIC SYSTEMS WITH RANDOM EXCITATIONS AS A MARKOV CHAIN PROBLEM
    ROBINSON, AC
    WOLAVER, LE
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1968, 14 (06) : 844 - +
  • [23] Genetic algorithm using the inhomogeneous Markov chain for job shop scheduling problem
    Interdisciplinary Graduate School of Medicine and Engineering, University of Yamanashi, 4-4-37, Takeda, Kofu, Yamanashi, Japan
    ICIC Express Lett., 2 (501-509):
  • [24] Misplaced Item Search in a Warehouse using an RFID-based Partially Observable Markov Decision Process (POMDP) Model
    Hariharan, Sharethram
    Bukkapatnam, Satish T. S.
    2009 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING, 2009, : 443 - +
  • [25] Structural properties for a two-state partially observable Markov decision process with an average cost criterion
    Goulionis, John E.
    JOURNAL OF STATISTICS & MANAGEMENT SYSTEMS, 2007, 10 (05): : 715 - 733
  • [26] THE JOB-SEARCH PROBLEM WITH COMPETITION - AN EVOLUTIONARILY STABLE DYNAMIC STRATEGY
    COLLINS, EJ
    MCNAMARA, JM
    ADVANCES IN APPLIED PROBABILITY, 1993, 25 (02) : 314 - 333
  • [27] The use of Markov chain theory in the problem of the dynamic stability of an elastic rod
    Antonov, I. L.
    PMM JOURNAL OF APPLIED MATHEMATICS AND MECHANICS, 2013, 77 (02): : 225 - 229
  • [28] A partially observable Markov chain framework to estimate overdiagnosis risk in breast cancer screening: Incorporating uncertainty in patients adherence behaviors
    Molani, Sevda
    Madadi, Mahboubeh
    Wilkes, Wesley
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2019, 89 : 40 - 53
  • [29] An improved genetic algorithm with dynamic neighborhood search for job shop scheduling problem
    Hu, Kongfu
    Wang, Lei
    Cai, Jingcao
    Cheng, Long
    MATHEMATICAL BIOSCIENCES AND ENGINEERING, 2023, 20 (09) : 17407 - 17427
  • [30] An Improved Genetic Algorithm with Local Search for Dynamic Job Shop Scheduling Problem
    Wang, Ming
    Zhang, Peng
    Zheng, Peng
    He, Junjie
    Zhang, Jie
    Bao, Jinsong
    2020 IEEE 16TH INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING (CASE), 2020, : 766 - 771