An Algorithm for Solving Intransitivities without Repeating Trials
Based on a recent method for solving intransitivities in repeated pair wise choice, we present how this algorithm is applied when there are no repeated trials. The new method assumption is: The more repetitions of an arc there are in the MMQO, the more original transitivities are based on this element, i.e., the more stable this arc is.
KeywordsPaired comparisons Intransitivities quasi order preference modelling transitive closure
Unable to display preview. Download preview PDF.