Flippable pairs and subset comparisons in comparative probability orderings

DOI10.1007/s11083-007-9068-yzbMath1148.60006OpenAlexW2075190915WikidataQ53288450 ScholiaQ53288450MaRDI QIDQ2464735

Robin Christian, Arkadii M. Slinko, Marston D. E. Conder

Publication date: 17 December 2007

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-007-9068-y

zbMATH Keywords

elicitationcomparative probabilityadditively representable linear ordersflip relationsubset comparison

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Cooperative games (91A12) Combinatorics of partially ordered sets (06A07) Individual preferences (91B08) Axioms; other general questions in probability (60A05) Mathematical psychology (91E99)

Related Items (4)

The voter basis and the admissibility of tree characters ⋮ On the number of facets of polytopes representing comparative probability orders ⋮ De Finetti lattices and magog triangles ⋮ Extreme points of the credal sets generated by comparative probabilities

Uses Software

• Magma

Cites Work

• The enumeration of comparative probability relations
• Boolean term orders and the root system \(B_n\)
• The Magma algebra system. I: The user language
• A counterexample to Fishburn's conjecture on finite linear qualitative probability
• Finite linear qualitative probability
• Measurement structures and linear inequalities
• Intuitive Probability on Finite Sets
• Subset Comparisons for Additive Linear Orders
• Unnamed Item
• Unnamed Item

This page was built for publication: Flippable pairs and subset comparisons in comparative probability orderings