Hostname: page-component-89b8bd64d-4ws75 Total loading time: 0 Render date: 2026-05-07T08:55:19.501Z Has data issue: false hasContentIssue false

A Minimum-Cost Network-Flow Solution to the Case V Thurstone Scaling Problem

Published online by Cambridge University Press:  01 January 2025

James M. Lattin*
Affiliation:
Graduate School of Business, Stanford University
*
Requests for reprints should he sent to James M. Lattin, Graduate School of Business, Stanford University, Stanford, California, 94305.

Abstract

This paper presents an approach for determining unidimensional scale estimates that are relatively insensitive to limited inconsistencies in paired comparisons data. The solution procedure, shown to be a minimum-cost network-flow problem, is presented in conjunction with a sensitivity diagnostic that assesses the influence of a single pairwise comparison on traditional Thurstone (ordinary least squares) scale estimates. When the diagnostic indicates some source of distortion in the data, the network technique appears to be more successful than Thurstone scaling in preserving the interval scale properties of the estimates.

Information

Type
Original Paper
Copyright
Copyright © 1990 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