Rank preferences for an arbitrary proposer and rejecter, based on distance (i.e., difference) between them
get_proposer_rank(proposer, rejecter, window_size)
A matrix with length(proposer)
columns and
length(rejecter)
rows, giving ordered preferences for the proposer,
based on the absolute difference between the ith proposer index and the
rejecter indices, where differences larger than window_size
are
treated as omitted preferences, i.e., non-possibilities.
A vector containing indices of transitions for the proposing (optimal) party
A vector containing indices of transitions for the rejecting (pessimal) party
The maximum number of indices that are allowed to separate a predicted and reference transition, before the two are considered incompatible