IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v53y2024i19p6957-6976.html
   My bibliography  Save this article

An extended Markov-switching model approach to latent heterogeneity in departmentalized manpower systems

Author

Listed:
  • Everestus O. Ossai
  • Uchenna C. Nduka
  • Mbanefo S. Madukaife
  • Akaninyene U. Udom
  • Samson O. Ugwu

Abstract

In recent works in manpower planning interest has been awakened in modeling manpower systems in departmentalized framework. This, as a form of disaggregation, may solve the problem of observable heterogeneity but not latent heterogeneity; it rather opens up other aspects of latent heterogeneity hitherto unaccounted for in classical (non departmentalized) manpower models. In this article, a multinomial Markov-switching model is formulated for investigating latent heterogeneity in intra-departmental and interdepartmental transitions in departmentalized manpower systems. The formulation incorporates extensions of the mover-stayer principle resulting in several competing models. The best manpower model is chosen based on the optimum number of hidden states established by the use of Expectation-Maximization iterative algorithm for estimation of the model parameters and a search procedure for assessing model performance against one another. The illustration establishes the usefulness of the model formulation in highlighting hidden disparities in personnel transitions in a departmentalized manpower system and in avoiding wrong model specification.

Suggested Citation

  • Everestus O. Ossai & Uchenna C. Nduka & Mbanefo S. Madukaife & Akaninyene U. Udom & Samson O. Ugwu, 2024. "An extended Markov-switching model approach to latent heterogeneity in departmentalized manpower systems," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 53(19), pages 6957-6976, October.
  • Handle: RePEc:taf:lstaxx:v:53:y:2024:i:19:p:6957-6976
    DOI: 10.1080/03610926.2023.2255322
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2023.2255322
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/03610926.2023.2255322?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:lstaxx:v:53:y:2024:i:19:p:6957-6976. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.