A large population job search game with discrete time (Q2470116)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5234791
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A large population job search game with discrete time |
scientific article; zbMATH DE number 5234791 |
Statements
A large population job search game with discrete time (English)
0 references
13 February 2008
0 references
The paper aims to analyze a game-theoretical version of the one-sided job search problem with a large population of searchers, in a discrete time-horizons. It is assumed that there are at least as many available jobs as unemployed searchers, and, consequently, only the searchers are choosy. Each job has an associated value which influences the choice made by the searchers. The main interest is focused on the Nash equilibrium strategies for this type of game, and the conditions under which a unique Nash equilibrium exists are derived. The theoretical analysis is completed by numerical examples.
0 references
game
0 references
job search problem
0 references
Nash equilibrium
0 references
continuum of players
0 references
0.8452016711235046
0 references
0.7551249265670776
0 references
0.7383841872215271
0 references
0.7252432703971863
0 references
0.701034665107727
0 references
