Random utility representation of binary choice probabilities: Critical graphs yielding critical necessary conditions
From MaRDI portal
Publication:1896616
DOI10.1006/jmps.1995.1003zbMath0897.92045OpenAlexW2045021440MaRDI QIDQ1896616
Publication date: 19 October 1998
Published in: Journal of Mathematical Psychology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmps.1995.1003
facet-defining inequalitiesconvex polytoperankingsbinary choice probabilitiesrandom utility variables
Applications of graph theory (05C90) Social and behavioral sciences: general topics (91C99) Mathematical psychology (91E99) Questions of holomorphy and infinite-dimensional manifolds (58B12)
Related Items (34)
Binary choice, subset choice, random utility, and ranking: a unified perspective using the permutahedron ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ An approval-voting polytope for linear orders ⋮ Probabilistic biclassification and random variable representations ⋮ A transitivity analysis of bipartite rankings in pairwise multi-class classification ⋮ Facets of linear signed order polytopes. ⋮ Prior distributions for random choice structures ⋮ Weak order polytopes. ⋮ On the ERA ranking representability of pairwise bipartite ranking functions ⋮ Fence facets from non-regular graphs for the linear ordering polytope ⋮ The strongest facets of the acyclic subgraph polytope are unknown ⋮ The repeated insertion model for rankings: missing link between two subset choice models ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ The biorder polytope ⋮ Determining the automorphism group of the linear ordering polytope ⋮ Facets of the linear ordering polytope: a unification for the fence family through weighted graphs ⋮ How to recycle your facets ⋮ Regular choice systems: a general technique to represent them by random variables ⋮ Primary facets of order polytopes ⋮ Weighted graphs defining facets: A connection between stable set and linear ordering polytopes ⋮ Analysis of multinomial models under inequality constraints: applications to measurement theory ⋮ Multinomial models with linear inequality constraints: overview and improvements of computational methods for Bayesian inference ⋮ \textsc{QTest} 2.1: quantitative testing of theories of binary choice using Bayesian inference ⋮ Ordinal distributions associated to 3-monotone matrices ⋮ Signed orders, choice probabilities, and linear polytopes ⋮ On a weighted generalization of α-critical graphs ⋮ Extreme points of the credal sets generated by comparative probabilities ⋮ Random relations, random utilities, and random functions ⋮ Outranking Relations: Do They Have Special Properties? ⋮ A combinatorial study of partial order polytopes ⋮ On the combinatorial structure of the approval-voting polytope ⋮ Random utility models and their applications: Recent developments ⋮ Independent random utility representations ⋮ A general concept of majority rule
This page was built for publication: Random utility representation of binary choice probabilities: Critical graphs yielding critical necessary conditions
