cpp_wrapper_irving_check_stability

is a matrix with the preference order of each individual in the
market. If there are <code>n</code> individuals, then this matrix will be of
dimension <code>n-1</code> by <code>n</code>. The <code>i,j</code>th element refers to
<code>j</code>'s <code>i</code>th most favorite partner. Preference orders must be
specified using C++ indexing (starting at 0). The matrix <code>pref</code> must
be of dimension <code>n-1</code> by <code>n</code>.

pref

is a vector of length <code>n</code> corresponding to the
matchings that were formed (using C++ indexing). E.g. if the <code>4</code>th
element of this vector is <code>0</code> then individual <code>4</code> was matched
with individual <code>1</code>. If no stable matching exists, then this function
returns a vector of zeros.

matchings

This function checks if a given matching is stable for a particular set of
preferences. This function checks if there's an unmatched pair that would
rather be matched with each other than with their assigned partners.

Computes matching algorithms quickly 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.

cpp_wrapper_irving_check_stability: Check if a matching solves the stable roommate problem

Description

Usage

Arguments

Value