cpp_wrapper_ttc_check_stability

is a matrix with the preference order of all individuals in the
market. If there are <code>n</code> individuals, then this matrix will be of
dimension <code>n</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).

pref

is a vector of length <code>n</code> corresponding to the
matchings being made, so that e.g. if the <code>4</code>th element is <code>5</code>
then agent <code>4</code> was matched to agent <code>6</code>. This vector uses C++
indexing that starts at 0.

matchings

Check if a one-sided matching for the top trading cycle algorithm is stable

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.

Jan Tilly

matchingR

Matching Algorithms in R and C++

cpp_wrapper_ttc_check_stability function

<dl><dt>pref</dt>
<dd>is a matrix with the preference order of all individuals in the
market. If there are <code>n</code> individuals, then this matrix will be of
dimension <code>n</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).</dd>
<dt>matchings</dt>
<dd>is a vector of length <code>n</code> corresponding to the
matchings being made, so that e.g. if the <code>4</code>th element is <code>5</code>
then agent <code>4</code> was matched to agent <code>6</code>. This vector uses C++
indexing that starts at 0.</dd></dl>

Arguments

Check if a one-sided matching for the top trading cycle algorithm is stable — cpp_wrapper_ttc_check_stability

<dl>

<dt>pref</dt>
<dd>is a matrix with the preference order of all individuals in the
market. If there are <code>n</code> individuals, then this matrix will be of
dimension <code>n</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).</dd>


<dt>matchings</dt>
<dd>is a vector of length <code>n</code> corresponding to the
matchings being made, so that e.g. if the <code>4</code>th element is <code>5</code>
then agent <code>4</code> was matched to agent <code>6</code>. This vector uses C++
indexing that starts at 0.</dd>

</dl>

cpp_wrapper_ttc_check_stability: Check if a one-sided matching for the top trading cycle algorithm is stable

Description

Usage

Value

Arguments