Geometric and combinatorial properties of the polytope of binary choice probabilities

From MaRDI portal
Revision as of 00:11, 30 January 2024 by Import240129110155 (talk | contribs) (Created automatically from import240129110155)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1184363

DOI10.1016/0165-4896(92)90039-8zbMath0751.90006OpenAlexW1964477541WikidataQ127553679 ScholiaQ127553679MaRDI QIDQ1184363

Reinhard Suck

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




Related Items (29)

Binary choice, subset choice, random utility, and ranking: a unified perspective using the permutahedronA note on small linear-ordering polytopesBayes factors for state-trace analysisTesting a mixture model of single-peaked preferencesEvaluating decision maker ``type under \(p\)-additive utility representationsOn non-\(\{0,{1\over 2},1\}\) extreme points of the generalized transitive tournament polytopeAn approval-voting polytope for linear ordersProbabilistic biclassification and random variable representationsA lexicographic semiorder polytope and probabilistic representations of choiceA selective review of recent characterizations of stochastic choice models using distribution and functional equation techniquesGeneralizing the concept of binary choice systems induced by rankings: One way of probabilizing deterministic measurement structuresThe strongest facets of the acyclic subgraph polytope are unknownThe biorder polytopeAn ordinal evaluation of categorical judgement data by random utilities and a corresponding correlation analysisFacets of the linear ordering polytope: a unification for the fence family through weighted graphsHow to recycle your facetsRegular choice systems: a general technique to represent them by random variablesWeighted graphs defining facets: A connection between stable set and linear ordering polytopesGood Clusterings Have Large VolumeCombinatorial optimization and small polytopesAnalysis of multinomial models under inequality constraints: applications to measurement theoryMultinomial 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 inferenceOrdinal distributions associated to 3-monotone matricesRandom relations, random utilities, and random functionsOutranking Relations: Do They Have Special Properties?Random utility models and their applications: Recent developmentsIndependent random utility representationsA general concept of majority rule


Uses Software



Cites Work




This page was built for publication: Geometric and combinatorial properties of the polytope of binary choice probabilities