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 条
  • [41] A clustering-based modified variable neighborhood search algorithm for a dynamic job shop scheduling problem
    Adibi, Mohammad Amin
    Shahrabi, Jamal
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2014, 70 (9-12): : 1955 - 1961
  • [42] A hybrid genetic algorithm and tabu search for a multi-objective dynamic job shop scheduling problem
    Zhang, Liping
    Gao, Liang
    Li, Xinyu
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2013, 51 (12) : 3516 - 3531
  • [43] RE-STORM: Mapping the Decision-Making Problem and Non-Functional Requirements Trade-off to Partially Observable Markov Decision Processes
    Paucar, Luis H. Garcia
    Bencomo, Nelly
    2018 IEEE/ACM 13TH INTERNATIONAL SYMPOSIUM ON SOFTWARE ENGINEERING FOR ADAPTIVE AND SELF-MANAGING SYSTEMS (SEAMS), 2018, : 19 - 25
  • [44] Green finance and energy efficiency: Dynamic study of the spatial externality of institutional support in a digital economy by using hidden Markov chain
    Huo, Da
    Zhang, Xiaotao
    Meng, Shuang
    Wu, Gang
    Li, Junhang
    Di, Ruoqi
    ENERGY ECONOMICS, 2022, 116
  • [45] AN INTEGRATED DYNAMIC FACILITY LAYOUT AND JOB SHOP SCHEDULING PROBLEM: A HYBRID NSGA-II AND LOCAL SEARCH ALGORITHM
    Erfani, Behrad
    Ebrahimnejad, Sadoullah
    Moosavi, Amirhossein
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2020, 16 (04) : 1801 - 1834
  • [46] A Tabu Search Heuristic for the Robust Dynamic Bayesian Network Optimisation Problem Under the Supply Chain Ripple Effect
    Liu, Ming
    Tang, Hao
    Chu, Feng
    Zheng, Feifeng
    Chu, Chengbin
    ADVANCES IN PRODUCTION MANAGEMENT SYSTEMS: ARTIFICIAL INTELLIGENCE FOR SUSTAINABLE AND RESILIENT PRODUCTION SYSTEMS (APMS 2021), PT III, 2021, 632 : 673 - 680
  • [47] Multi-objective adaptive large neighbourhood search algorithm for dynamic flexible job shop schedule problem with transportation resource
    Liu, Jiaojiao
    Sun, Baofeng
    Li, Gendao
    Chen, Yuqi
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2024, 132
  • [48] A robust block-chain based tabu search algorithm for the dynamic lot sizing problem with product returns and remanufacturing
    Li, Xiangyong
    Baki, Fazle
    Tian, Peng
    Chaouch, Ben A.
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2014, 42 (01): : 75 - 87
  • [49] A Reinforcement Learning Variable Neighborhood Search for the Robust Dynamic Bayesian Network Optimization Problem under the Supply Chain Ripple Effect
    Liu, Ming
    Tang, Hao
    Chu, Feng
    Zheng, Feifeng
    Chu, Chengbin
    IFAC PAPERSONLINE, 2022, 55 (10): : 1459 - 1464
  • [50] Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in Small and Medium Enterprises
    Ali Asghar Rahmani Hosseinabadi
    Hajar Siar
    Shahaboddin Shamshirband
    Mohammad Shojafar
    Mohd Hairul Nizam Md. Nasir
    Annals of Operations Research, 2015, 229 : 451 - 474