Geometric and combinatorial properties of the polytope of binary choice probabilities
From MaRDI portal
Publication:1184363
DOI10.1016/0165-4896(92)90039-8zbMath0751.90006OpenAlexW1964477541WikidataQ127553679 ScholiaQ127553679MaRDI QIDQ1184363
Publication date: 28 June 1992
Published in: Mathematical Social Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0165-4896(92)90039-8
polytopefacetslinear ordering problempermutation polytopebinary choice probabilitiesbinary choice probabilistic
Decision theory (91B06) Applications of mathematical programming (90C90) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27)
Related Items
Binary choice, subset choice, random utility, and ranking: a unified perspective using the permutahedron, A note on small linear-ordering polytopes, Bayes factors for state-trace analysis, Testing a mixture model of single-peaked preferences, Evaluating decision maker ``type under \(p\)-additive utility representations, On non-\(\{0,{1\over 2},1\}\) extreme points of the generalized transitive tournament polytope, An approval-voting polytope for linear orders, Probabilistic biclassification and random variable representations, A lexicographic semiorder polytope and probabilistic representations of choice, A selective review of recent characterizations of stochastic choice models using distribution and functional equation techniques, Generalizing the concept of binary choice systems induced by rankings: One way of probabilizing deterministic measurement structures, The strongest facets of the acyclic subgraph polytope are unknown, The biorder polytope, An ordinal evaluation of categorical judgement data by random utilities and a corresponding correlation analysis, 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, Weighted graphs defining facets: A connection between stable set and linear ordering polytopes, Good Clusterings Have Large Volume, Combinatorial optimization and small 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, Random relations, random utilities, and random functions, Outranking Relations: Do They Have Special Properties?, Random utility models and their applications: Recent developments, Independent random utility representations, A general concept of majority rule
Uses Software
Cites Work
- Median linear orders: Heuristics and a branch and bound algorithm
- Random utility representation of binary choice probabilities: A new class of necessary conditions
- A historical and contemporary perspective on random scale representations of choice probabilities and reaction times in the context of Cohen and Falmagne's (1990, Journal of Mathematical Psychology, 34) results
- Induced binary probabilities and the linear ordering polytope: A status report
- Convex polyhedra of doubly stochastic matrices. II: Graph of Omega sub(n)
- Convex polyhedra of doubly stochastic matrices. I: Applications of the permanent function
- Convex polyhedra of doubly stochastic matrices III. Affine and combinatorial properties of \(\Omega\)
- Mixtures of order matrices and generalized order matrices
- Binary choice probabilities and rankings
- A necessary but insufficient condition for the stochastic binary choice problem
- On the acyclic subgraph polytope
- Facets of the linear ordering polytope
- Shellable Decompositions of Cells and Spheres.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
