A Mate-Matching Algorithm for Continuous-Time Microsimulation Models
The timing of partnership formation in closed continuous-time microsimulation models poses difficulties due to the continuous time scale. In this paper the problem is resolved by the concept of a partnership market, which individuals can enter and leave at any point in time over the complete simulation time range. Each individual, who looks for a spouse, remains in the market for a specific period during which searching and matching is performed. To build up synthetic couples, the model imitates a decision making-process. The decision to enter a partnership depends on empirically estimated logit models for the probability that a given woman and a given man will get together, and also on an individual aspiration level regarding a potential partner. A couple is formed if a positive decision has been made and the timing of the partnership formation is consistent with the individual searching periods of the prospective spouses. The algorithm is illustrated by an example in which simulations are run to project a synthetic population, similar to the population of the Netherlands, by using an extended version of the microsimulation tool of the MicMac project.
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.:
- Peter Todd & Francesco Billari & Jorge Simão, 2005. "Aggregate age-at-marriage patterns from individual mate-search heuristics," Demography, Springer, vol. 42(3), pages 559-574, August.
When requesting a correction, please mention this item's handle: RePEc:ijm:journl:v:5:y:2012:i:1:p:31-51. 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: (Gijs Dekkers)
If references are entirely missing, you can add them using this form.