Description

This is the C++ wrapper for the top trading cycle algorithm. Users should not call this function directly, but instead use toptrading.

Usage

Arguments

Details

This function uses the top trading cycle algorithm to find a stable trade between agents, each with some indivisible good, and with preferences over the goods of other agents. Each agent is matched to one other agent, and matchings are not necessarily two-way. Agents may be matched with themselves.

Value

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