A Large Population, Game Theoretic Model Of Job-Search With Discounting
This paper considers a large population, game theoretic job-search problem, in which the ratio of job searchers to jobs is α. There are n distinct types of jobs, each with an associated value. Each searcher can only accept one job and cannot recall a job previously rejected. Once a searcher accepts a job, no other searcher can obtain that particular job. The reward to a searcher is taken to be the value of the job he/she obtains discounted by a factor of e-γt, where t is the time spent searching and γ > 0. It is shown that a unique evolutionarily stable strategy (ESS) exists for such problems. Two iterative algorithms for approximating the ESS are considered. In the case where there are only two types of job, the ESS can be calculated directly.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 11 (2009)
Issue (Month): 03 ()
|Contact details of provider:|| Web page: http://www.worldscinet.com/igtr/igtr.shtml|
|Order Information:|| Email: |
When requesting a correction, please mention this item's handle: RePEc:wsi:igtrxx:v:11:y:2009:i:03:p:301-320. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Tai Tone Lim)
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.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.