Partnership formation with age-dependent preferences
AbstractWe analyze a model of partnership formation in which players’ preferences are based on the age of a prospective partner. There are two classes of individuals, called for convenience here male and female. Males and females are fertile for the same length of time, normalized to one unit. A male enters the mating pool at age 0 and meets prospective partners according to a Poisson process. At equilibrium, he accepts a female if the utility from mating exceeds the expected utility from future search, which depends on the acceptance strategies of all males and females and the corresponding steady-state distribution of age in the pool of unmated individuals. Females face an analogous problem. Mating pairs are only formed by mutual consent and individuals leave the pool of unmated individuals on finding a mating partner or reaching the age of 1. A policy iteration algorithm is used to determine the equilibrium acceptance strategies and the corresponding steady-state distribution of the age of individuals in the mating pool. Two examples are presented.
Download InfoIf 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.
Bibliographic InfoArticle provided by Elsevier in its journal European Journal of Operational Research.
Volume (Year): 225 (2013)
Issue (Month): 1 ()
Contact details of provider:
Web page: http://www.elsevier.com/locate/eor
Game theory; Partnership formation; Policy iteration; Equilibrium profile;
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Shimer, R. & Smith, L., 1997.
"Assortative Matching and Search,"
97-2a, Massachusetts Institute of Technology (MIT), Department of Economics.
- Ramsey, David M., 2008. "A large population job search game with discrete time," European Journal of Operational Research, Elsevier, vol. 188(2), pages 586-602, July.
- Lones Smith, 2006. "The Marriage Model with Search Frictions," Journal of Political Economy, University of Chicago Press, vol. 114(6), pages 1124-1146, December.
- Alpern, Steve & Katrantzi, Ioanna, 2009. "Equilibria of two-sided matching games with common preferences," European Journal of Operational Research, Elsevier, vol. 196(3), pages 1214-1222, August.
- Vladimir Mazalov & Anna Falko, 2008. "Nash Equilibrium In Two-Sided Mate Choice Problem," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 10(04), pages 421-435.
- Burdett, Kenneth & Coles, Melvyn G, 1999. "Long-Term Partnership Formation: Marriage and Employment," Economic Journal, Royal Economic Society, vol. 109(456), pages F307-34, June.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
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.