cpp_wrapper_irving

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

This is the C++ wrapper for the stable roommate problem. Users should not
call this function directly, but instead use
<code><a rd-options="" href="/link/roommate?package=matchingR&version=1.3.3" data-mini-rdoc="matchingR::roommate">roommate</a></code>.

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_irving function

This is the C++ wrapper for the stable roommate problem. Users should not
call this function directly, but instead use
<code><a rd-options='' href='roommate'>roommate</a></code>.

cpp_wrapper_irving: Computes a stable roommate matching

Description

Usage

Arguments

Value