Pages that link to "Item:Q1896616"
From MaRDI portal
The following pages link to Random utility representation of binary choice probabilities: Critical graphs yielding critical necessary conditions (Q1896616):
Displaying 46 items.
- A lexicographic semiorder polytope and probabilistic representations of choice (Q440019) (← links)
- Random utility representation of binary choice probabilities: A new class of necessary conditions (Q582231) (← links)
- A transitivity analysis of bipartite rankings in pairwise multi-class classification (Q621565) (← links)
- On the ERA ranking representability of pairwise bipartite ranking functions (Q646530) (← links)
- Regular choice systems: a general technique to represent them by random variables (Q730163) (← links)
- Primary facets of order polytopes (Q730181) (← links)
- A representation theorem for finite best-worst random utility models (Q825139) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Weighted graphs defining facets: A connection between stable set and linear ordering polytopes (Q1013288) (← links)
- Analysis of multinomial models under inequality constraints: applications to measurement theory (Q1042296) (← links)
- Induced binary probabilities and the linear ordering polytope: A status report (Q1184362) (← links)
- Geometric and combinatorial properties of the polytope of binary choice probabilities (Q1184363) (← links)
- Ordinal distributions associated to 3-monotone matrices (Q1301672) (← links)
- An approval-voting polytope for linear orders (Q1368384) (← links)
- Probabilistic biclassification and random variable representations (Q1368395) (← links)
- Facets of linear signed order polytopes. (Q1414239) (← links)
- Weak order polytopes. (Q1420590) (← links)
- A short proof of a theorem of Falmagne. (Q1431817) (← links)
- Signed orders, choice probabilities, and linear polytopes (Q1598972) (← links)
- Random relations, random utilities, and random functions (Q1604280) (← links)
- Binary choice probabilities and rankings (Q1676602) (← links)
- Extended formulations for order polytopes through network flows (Q1736010) (← links)
- The biorder polytope (Q1765958) (← links)
- A combinatorial study of partial order polytopes (Q1867280) (← links)
- On the combinatorial structure of the approval-voting polytope (Q1867363) (← links)
- Random utility models and their applications: Recent developments (Q1867815) (← links)
- Independent random utility representations (Q1867819) (← links)
- A general concept of majority rule (Q1867821) (← links)
- Binary choice, subset choice, random utility, and ranking: a unified perspective using the permutahedron (Q1877595) (← links)
- The repeated insertion model for rankings: missing link between two subset choice models (Q2259977) (← links)
- Multinomial models with linear inequality constraints: overview and improvements of computational methods for Bayesian inference (Q2332837) (← links)
- \textsc{QTest} 2.1: quantitative testing of theories of binary choice using Bayesian inference (Q2332851) (← links)
- Extreme points of the credal sets generated by comparative probabilities (Q2348072) (← links)
- Prior distributions for random choice structures (Q2437251) (← links)
- Fence facets from non-regular graphs for the linear ordering polytope (Q2448162) (← links)
- An ordinal evaluation of categorical judgement data by random utilities and a corresponding correlation analysis (Q2491934) (← links)
- Facets of the linear ordering polytope: a unification for the fence family through weighted graphs (Q2497757) (← links)
- How to recycle your facets (Q2506820) (← links)
- Random utility representations of finite \(m\)-ary relations (Q2564062) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- On a weighted generalization of α-critical graphs (Q3439372) (← links)
- The strongest facets of the acyclic subgraph polytope are unknown (Q4645939) (← links)
- Outranking Relations: Do They Have Special Properties? (Q4883192) (← links)
- Determining the automorphism group of the linear ordering polytope (Q5946819) (← links)
- Adjacencies on random ordering polytopes and flow polytopes (Q6134082) (← links)
- The best-worst-choice polytope on four alternatives (Q6134083) (← links)
