- On solving intransitiveities in repeated pairwise choices
- Mathematical Social Sciences
- Pages (from-to)
- Document type
- Faculty of Economics and Business (FEB)
- Amsterdam School of Economics Research Institute (ASE-RI)
A method is presented to transform intransitive, possibly incomplete, preferences between objects into a transitive ordering. In most cases the method provides a unique solution which is easily computed, also if many objects are involved. The method takes into account information about stabililty or intensity of preferences. Preferences are represented as arcs in a digraph. The number of arc reversals that form the solution often coincides with the minimal number of arc reversals known as Slater's i. A Monte Carlo study is reported that strongly supports the method. The method is shown to require polynomial computation time.
- go to publisher's site
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.