stableRoommateMatching

A matrix with agent's cardinal preferences. Column i is agent i's preferences.

pref

This function computes the Irving (1985) algorithm for finding
a stable matching in a one-sided matching market. Note that neither
existence nor uniqueness is guaranteed, this algorithm finds one
matching, not all of them. If no matching exists, returns 0.

Computes matching algorithms efficiently using Rcpp.
    Implements the Gale-Shapley Algorithm to compute the stable matching for
    two-sided markets, such as the stable marriage problem and the
    college-admissions problem. Implements Irving's Algorithm for
    the stable roommate problem. Implements the top trading cycle
    algorithm for the indivisible goods trading problem.

stableRoommateMatching: Computes a stable roommate matching

Description

Usage

Arguments

Value