Subset Comparisons for Additive Linear Orders

DOI10.1287/MOOR.27.1.227.339MaRDI QIDQ5704072zbMATH OpenOpenAlexFDO

Authors James A. Reeds, Peter Fishburn, Aleksandar Pekeč

Publication date 11 November 2005

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.27.1.227.339

zbMATH Keywords

additive linear ordersdepth-first searchextensive measurementsubjective probabilitysubset comparisons

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Boolean algebras with additional operations (diagonalizable algebras, etc.) (06E25) Combinatorics in computer science (68R05) Decision theory (91B06) Measurement theory in the social and behavioral sciences (91C05)

Recommendations

• Flippable pairs and subset comparisons in comparative probability orderings
• Linear extensions of additive partial orders
• Signed orders, choice probabilities, and linear polytopes
• Additive representations on rank-ordered sets. I: The algebraic approach
• Finite linear qualitative probability

Cited in

(9)

• On effective linearly ordered sets of comparison functions
• Random utility models and their applications: Recent developments
• De Finetti lattices and magog triangles
• Computer science and decision theory
• Flippable pairs and subset comparisons in comparative probability orderings
• scientific article; zbMATH DE number 3949487 (Why is no real title available?)
• On the number of facets of polytopes representing comparative probability orders
• A characterization of the existence of succinct linear representation of subset-valuations
• Questionable stepwise explanations for a robust additive preference model

This page was built for publication: Subset Comparisons for Additive Linear Orders

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