An algorithm for solving intransitivities without repeating trials

MaRDI QIDQ4225342zbMATH OpenFDO

Authors Jacinto González-Pachón, Isabel Rodríguez-Galiano

Publication date 28 October 1999

zbMATH Keywords

intransitivitiespaired comparisonspreference modellingquasi ordertransitive closure

Mathematics Subject Classification ID

Individual preferences (91B08)

Recommendations

• On solving intransitivities in repeated pairwise choices
• A weak order solution to a group ranking and consistency-driven pairwise comparisons
• Tournaments, transitivity and pairwise comparison matrices
• The probability of intransitivity of pairwise comparisons in individual preference
• A heuristic method to rectify intransitive judgments in pairwise comparison matrices

Cited in

(5)

• A trivial algorithm whose analysis is not: a continuation
• On producing multiple solutions using repeated trials
• A repeated-update problem in the DeltaBlue algorithm
• On solving intransitivities in repeated pairwise choices
• scientific article; zbMATH DE number 3570344 (Why is no real title available?)

This page was built for publication: An algorithm for solving intransitivities without repeating trials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4225342)