A matching method for elderly care service personnel with multiple types of service expectations

With the rapid growth of the global aging population, the problem of providing for the elderly has become increasingly prominent. As a new model of providing for the elderly in China, home-based care has attracted more and more attention from all walks of life. The research on how to realize reasonable and effective matching between elderly care service personnel and the elderly under the home care model deserves attention and has important practical significance. In this paper, a matching method for elderly care service personnel considering multi-type service expectations is proposed. This approach involves first obtaining the actual values of the expectation indexes for each other, as well as the expectation requirements of the elderly and the service personnel. Next, we compute the satisfaction of the elderly and the service personnel for each other based on the elastic service expectation type, and finally, we make a decision about whom to choose based on the inelastic service expectation indexes. On this basis, the situation is considered that there are sufficient and insufficient elderly care service personnel, the two-sided matching models are constructed, respectively, and the optimal matching results are obtained by solving the models. Finally, an example is given to illustrate the feasibility and effectiveness of the proposed method.

Authors

Institutions

Publication Details

Journal
PLoS ONE
Published
2025-02-03
DOI
https://doi.org/10.1371/journal.pone.0309419
Citations
1
Primary Topic
Customer Service Quality and Loyalty
Type
article
Field-Weighted Citation Impact
2.76
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A matching method for elderly care service personnel with multiple types of service expectations

Chao Yu, Tianxiang Gao
1 citations
PLoS ONE
Customer Service Quality and Loyalty
2.76
article

A matching method for elderly care service personnel with multiple types of service expectations

Chao Yu, Tianxiang Gao
article en
1 citations

Abstract

With the rapid growth of the global aging population, the problem of providing for the elderly has become increasingly prominent. As a new model of providing for the elderly in China, home-based care has attracted more and more attention from all walks of life. The research on how to realize reasonable and effective matching between elderly care service personnel and the elderly under the home care model deserves attention and has important practical significance. In this paper, a matching method for elderly care service personnel considering multi-type service expectations is proposed. This approach involves first obtaining the actual values of the expectation indexes for each other, as well as the expectation requirements of the elderly and the service personnel. Next, we compute the satisfaction of the elderly and the service personnel for each other based on the elastic service expectation type, and finally, we make a decision about whom to choose based on the inelastic service expectation indexes. On this basis, the situation is considered that there are sufficient and insufficient elderly care service personnel, the two-sided matching models are constructed, respectively, and the optimal matching results are obtained by solving the models. Finally, an example is given to illustrate the feasibility and effectiveness of the proposed method.

PLoS ONEVol. 20(2)
Shenyang University of Technology (CN)
Peace, Justice and strong institutions
Openalex Percentile: Top 13%
Customer Service Quality and Loyalty
2.76
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.