Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T10:51:26.460Z Has data issue: false hasContentIssue false

A Recursive Partitioning Method for the Prediction of Preference Rankings Based Upon Kemeny Distances

Published online by Cambridge University Press:  01 January 2025

Antonio D’Ambrosio*
Affiliation:
University of Naples Federico II
Willem J. Heiser
Affiliation:
Leiden University
*
Correspondence should be made to Antonio D’Ambrosio, Department of Economics and Statistics, University of Naples Federico II, Via Cinthia, 80126 Naples, Italy. Email: antdambr@unina.it

Abstract

Preference rankings usually depend on the characteristics of both the individuals judging a set of objects and the objects being judged. This topic has been handled in the literature with log-linear representations of the generalized Bradley-Terry model and, recently, with distance-based tree models for rankings. A limitation of these approaches is that they only work with full rankings or with a pre-specified pattern governing the presence of ties, and/or they are based on quite strict distributional assumptions. To overcome these limitations, we propose a new prediction tree method for ranking data that is totally distribution-free. It combines Kemeny’s axiomatic approach to define a unique distance between rankings with the CART approach to find a stable prediction tree. Furthermore, our method is not limited by any particular design of the pattern of ties. The method is evaluated in an extensive full-factorial Monte Carlo study with a new simulation design.

Information

Type
Original Paper
Copyright
Copyright © 2016 The Psychometric Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable