2016
DOI: 10.1504/ijcee.2016.079534
|View full text |Cite
|
Sign up to set email alerts
|

Limit your applications. Dealing with congested markets in the matching procedure

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
1
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…Because the problem of optimal applications is an economics problem, there has been a search for solutions and a developing literature on the subject. Balter et al show that limiting the number of applications candidates can submit is superior to limiting the number of applications a program can evaluate. Entering an application limit into the Gale/Shapley algorithm that underlies the matching process, the authors conclude that "the optimal limit in the number of applications balances the tradeoff between being unmatched and gaining a better match in the aggregate, and the benefit can be considerable if the graduates' preferences over the positions are not very correlated."…”
mentioning
confidence: 99%
“…Because the problem of optimal applications is an economics problem, there has been a search for solutions and a developing literature on the subject. Balter et al show that limiting the number of applications candidates can submit is superior to limiting the number of applications a program can evaluate. Entering an application limit into the Gale/Shapley algorithm that underlies the matching process, the authors conclude that "the optimal limit in the number of applications balances the tradeoff between being unmatched and gaining a better match in the aggregate, and the benefit can be considerable if the graduates' preferences over the positions are not very correlated."…”
mentioning
confidence: 99%