Skip to main content
×
×
Home

The job search problem as an employer–candidate game

  • J. M. Mcnamara (a1) and E. J. Collins (a1)
Abstract

In the standard job search problem a single decision-maker (say an employer) has to choose from a sequence of candidates of varying fitness. We extend this formulation to allow both employers and candidates to make choices. We consider an infinite population of employers and an infinite population of candidates. Each employer interviews a (possibly infinite) sequence of candidates for a post and has the choice of whether or not to offer a candidate the post. Each candidate is interviewed by a (possibly infinite) sequence of employers and can accept or reject each offer. Each employer seeks to maximise the fitness of the candidate appointed and each candidate seeks to maximise the fitness of their eventual employer. We allow both discounting and/or a cost per interview. We find that there is a unique pair of policies (for employers and candidates respectively) which is in Nash equilibrium. Under these policies each population is partitioned into a finite or countable sequence of subpopulations, such that an employer (candidate) in a given subpopulation ends up matched with the first candidate (employer) encountered from the corresponding subpopulation. In some cases the number of non-empty subpopulations in the two populations will differ and some members of one population will never be matched.

Copyright
Corresponding author
Postal address for both authors: School of Mathematics, University of Bristol, University Walk, Bristol BS8 1TW, UK.
References
Hide All
Ferguson, T. S. (1989) Who solved the secretary problem? Statist. Sci. 4, 282296.
Freeman, P. R. (1983) The secretary problem and its extensions: a review. Internat. Statist. Rev. 51, 189206.
Lippman, S. A. and Mccall, J. J. (1976) The economics of job search: a survey. Econ. Inquiry 14, 155189.
Parker, G. A. (1983) Mate quality and mating decisions. In Mate Choice, ed. Bateson, P., Cambridge University Press, pp. 141164.
Whittle, P. (1982) Optimisation Over Time, Vol. 1. Wiley, New York.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Journal of Applied Probability
  • ISSN: 0021-9002
  • EISSN: 1475-6072
  • URL: /core/journals/journal-of-applied-probability
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed