Pages that link to "Item:Q582231"

The following pages link to Random utility representation of binary choice probabilities: A new class of necessary conditions (Q582231):

Displaying 23 items.

• 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)
• Regular choice systems: a general technique to represent them by random variables (Q730163) (← links)
• Primary facets of order polytopes (Q730181) (← links)
• Stochastic revealed preference and rationalizability (Q763359) (← 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)
• Generalizing the concept of binary choice systems induced by rankings: One way of probabilizing deterministic measurement structures (Q1184360) (← 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)
• Ordinal distributions associated to 3-monotone matrices (Q1301672) (← links)
• Weak order polytopes. (Q1420590) (← links)
• Signed orders, choice probabilities, and linear polytopes (Q1598972) (← links)
• Binary choice, subset choice, random utility, and ranking: a unified perspective using the permutahedron (Q1877595) (← links)
• On the integral dicycle packings and covers and the linear ordering polytope (Q1894372) (← links)
• Regular random choice and the triangle inequalities (Q2087563) (← links)
• \textsc{QTest} 2.1: quantitative testing of theories of binary choice using Bayesian inference (Q2332851) (← links)
• Fence facets from non-regular graphs for the linear ordering polytope (Q2448162) (← 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)
• Binary single-crossing random utility models (Q2685843) (← links)
• Outranking Relations: Do They Have Special Properties? (Q4883192) (← links)