Highly Influenced

# Greedy Matchings

@inproceedings{IrvingGreedyM, title={Greedy Matchings}, author={Robert W. Irving} }

Suppose that each member of a set of n applicants ranks a subset of a set of m posts in strict order of preference. A matching is a set of (post, applicant) pairs such that each applicant and each post appears in at most one pair. A greedy matching is one in which the maximum possible number of applicants are matched to their rst choice post, and subject to that condition, the maximum possible number are matched to their second choice post, and so on. This is a relevant concept in any practicalâ€¦Â CONTINUE READING

#### From This Paper

##### Figures, tables, and topics from this paper.

12 Citations

6 References

Similar Papers

#### References

##### Publications referenced by this paper.

Showing 1-6 of 6 references