Pages that link to "Item:Q1813607"
From MaRDI portal
The following pages link to A necessary but insufficient condition for the stochastic binary choice problem (Q1813607):
Displaying 23 items.
- Random utility representation of binary choice probabilities: A new class of necessary conditions (Q582231) (← links)
- 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 (Q582233) (← links)
- Smallest tournaments not realizable by \({\frac{2}{3}}\)-majority voting (Q836934) (← 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)
- The stochastic choice problem: A game-theoretic approach (Q1206408) (← links)
- A game-theoretic approach to the binary stochastic choice problem (Q1206409) (← links)
- More facets from fences for linear ordering and acyclic subgraph polytopes (Q1326756) (← 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)
- Binary choice probabilities and rankings (Q1676602) (← links)
- On the integral dicycle packings and covers and the linear ordering polytope (Q1894372) (← links)
- Random utility representation of binary choice probabilities: Critical graphs yielding critical necessary conditions (Q1896616) (← links)
- On non-\(\{0,{1\over 2},1\}\) extreme points of the generalized transitive tournament polytope (Q1906776) (← links)
- \textsc{QTest} 2.1: quantitative testing of theories of binary choice using Bayesian inference (Q2332851) (← links)
- Facets of the linear ordering polytope: a unification for the fence family through weighted graphs (Q2497757) (← links)
- A conjecture on the construction of orderings by Borda's rule (Q2629514) (← links)
- Binary single-crossing random utility models (Q2685843) (← links)
- The strongest facets of the acyclic subgraph polytope are unknown (Q4645939) (← links)
- Outranking Relations: Do They Have Special Properties? (Q4883192) (← links)
- The interval order polytope of a digraph (Q5101405) (← links)
