2015
DOI: 10.1016/j.cie.2015.05.017
|View full text |Cite
|
Sign up to set email alerts
|

Assignment of trainees to software project requirements: A stable matching based approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 20 publications
(4 citation statements)
references
References 29 publications
0
4
0
Order By: Relevance
“…Considering the preference lists with ties in the two-sided stable matching problem, Kamiyama (2014) proposed an approach to finding a stable and Pareto efficient matching scheme with a time complexity of O(m4logn+m3log2n). For the two-sided market with large number of agents it is difficult and time consuming to generate the required preferences, so Gharote et al. (2015) proposed a method to predict preferences for all agents using an additive utility function, and then described a mathematical formulation with which to find a stable matching scheme.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Considering the preference lists with ties in the two-sided stable matching problem, Kamiyama (2014) proposed an approach to finding a stable and Pareto efficient matching scheme with a time complexity of O(m4logn+m3log2n). For the two-sided market with large number of agents it is difficult and time consuming to generate the required preferences, so Gharote et al. (2015) proposed a method to predict preferences for all agents using an additive utility function, and then described a mathematical formulation with which to find a stable matching scheme.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Furthermore, the stable matching ensures that every element a i in the set A is assigned the best element bi in set B, based on the preference. The concept of two-sided matching problems was first demonstrated for college admissions by Gale and Shapley (1962) and later extended to real-life problems, such as 'roommate assignment' problem (Irving, 1985), 'workforce assignment' problem (Gharote et al, 2015), 'student-project allocation (SPA)' problem (Abraham et al, 2007;Teo and Ho, 1998) etc.…”
Section: Existing Spa Approachesmentioning
confidence: 99%
“…The two-sided matching decision making (TSMDM) is about how to match the agents of two sides according to their own preferences. There exist a large number of TSMDM problems in reality, such as taxi dispatching and stable marriage [1,2], college admissions [3], job matchings [4], and staff designation [5]. Hence, the TSMDM is a hot theme with far-ranging actual backgrounds.…”
Section: Introductionmentioning
confidence: 99%