Hostname: page-component-78c5997874-m6dg7 Total loading time: 0 Render date: 2024-11-18T08:46:57.025Z Has data issue: false hasContentIssue false
  • English
  • Français

Simulation of the Matching Problem of Montmort

Published online by Cambridge University Press:  27 July 2009

Frans Schalekamp
Frans Schalekamp
Affiliation:
Department of Econometrics, Vrije University, 1081 HV Amsterdam
Get access Rights & Permissions [Opens in a new window]

Abstract

This note presents an efficient algorithm for the simulation of the number of invariant positions in a random permutation of the integers 1,..., n. An application to the famous matching problem of Montmort is discussed.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 12 , Issue 3 , July 1998 , pp. 325 - 328
Copyright
Copyright © Cambridge University Press 1998

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.de Montmort, P.R. (1708). Essay d'analyse sur les jeux de hazard. Paris: J. Quillan.Google Scholar
2.Ross, S.M. (1997). Simulation, 2nd ed.Orlando: Academic Press.Google ScholarPubMed
3.Ross, S.M. (1997). Introduction to probability models, 6th ed.Orlando: Academic Press.Google Scholar