roommate.checkPreferences

is a matrix with the preference order of each individual in the
market. This argument is only required when <code>utils</code> is not provided.
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 can either be specified
using R-indexing (starting at 1) or C++ indexing (starting at 0). The
matrix <code>pref</code> must be of dimension <code>n-1</code> by <code>n</code>. Otherwise,
the function will throw an error.

pref

Check if preference order for a one-sided market is complete

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++

roommate.checkPreferences function

<dl><dt>pref</dt>
<dd>is a matrix with the preference order of each individual in the
market. This argument is only required when <code>utils</code> is not provided.
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 can either be specified
using R-indexing (starting at 1) or C++ indexing (starting at 0). The
matrix <code>pref</code> must be of dimension <code>n-1</code> by <code>n</code>. Otherwise,
the function will throw an error.</dd></dl>

Arguments

Check if preference order for a one-sided market is complete — roommate.checkPreferences

<dl>

<dt>pref</dt>
<dd>is a matrix with the preference order of each individual in the
market. This argument is only required when <code>utils</code> is not provided.
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 can either be specified
using R-indexing (starting at 1) or C++ indexing (starting at 0). The
matrix <code>pref</code> must be of dimension <code>n-1</code> by <code>n</code>. Otherwise,
the function will throw an error.</dd>

</dl>

roommate.checkPreferences: Check if preference order for a one-sided market is complete

Description

Usage

Value

Arguments