OSDR-package: Finds an Optimal System of Distinct Representatives

In OSDR: Finds an Optimal System of Distinct Representatives

Finds an Optimal System of Distinct Representatives

Description

Provides routines for finding an Optimal System of Distinct Representatives (OSDR), as defined by D.Gale (1968) <doi:10.1016/S0021-9800(68)80039-0>.

Details

This package was not yet installed at build time.
Index: This package was not yet installed at build time.

The aim of this small package is to provide a function solving the assignment problem on an ordered set. This matching problem can be viewed in two ways. First, as the original ordered assignment problem, where a set of jobs, ordered by importance, must be filled by suitable applicants in the best possible way. Second, as an ordered matching problem where treated unit should be matched in order of importance with suitable controls. Suitability can be obtained by a ”caliper”: units within the caliper having zero matching cost and units outside the caliper having infinity cost. The main function OSDR exploits an algorithm suggested by I.Anderson to find an order optimal matching, as defined by D.Gale (see OSDR for details). The package includes some utilities and examples (both combinatorial and statistically oriented) to illustrate the use of OSDR.

Author(s)

Massimo Cannas [aut, cre]

Maintainer: Massimo Cannas <[e-mail]>

References

Gale, D. (1968) Optimal matching in an ordered set: an application of matroid theory. Journal of Combinatorial Theory 4, pp. 176-180.

Anderson, I. (1989) A first course in Combinatorial Mathematics. Oxford University Press.

Rosenbaum, P. R. (1989). Optimal matching for observational studies. Journal of the American Statistical Association 84(408): pp. 1024-1032.

Examples

#See OSDR help for the examples. 

OSDR documentation built on March 18, 2022, 7:33 p.m.