Pages that link to "Item:Q1184362"

The following pages link to Induced binary probabilities and the linear ordering polytope: A status report (Q1184362):

Displaying 44 items.

• Bayes factors for state-trace analysis (Q296937) (← links)
• New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796) (← links)
• Regular choice systems: a general technique to represent them by random variables (Q730163) (← links)
• A semidefinite optimization approach to the target visitation problem (Q895779) (← links)
• Proportional scheduling, split-proofness, and merge-proofness (Q932808) (← links)
• An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
• Analysis of multinomial models under inequality constraints: applications to measurement theory (Q1042296) (← links)
• A selective review of recent characterizations of stochastic choice models using distribution and functional equation techniques (Q1184357) (← links)
• Generalizing the concept of binary choice systems induced by rankings: One way of probabilizing deterministic measurement structures (Q1184360) (← links)
• Geometric and combinatorial properties of the polytope of binary choice probabilities (Q1184363) (← links)
• Ordinal distributions associated to 3-monotone matrices (Q1301672) (← links)
• Optimal facility layout design (Q1306388) (← links)
• Unimodal binary distributions (Q1318826) (← links)
• More facets from fences for linear ordering and acyclic subgraph polytopes (Q1326756) (← 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)
• Choosing from a weighted tournament (Q1575093) (← links)
• Signed orders, choice probabilities, and linear polytopes (Q1598972) (← links)
• Random relations, random utilities, and random functions (Q1604280) (← links)
• Revealed stochastic preference: a one-paragraph proof and generalization (Q1738419) (← links)
• The biorder polytope (Q1765958) (← links)
• A combinatorial study of partial order polytopes (Q1867280) (← 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 random utility model with an infinite choice space (Q1906035) (← links)
• On the partial order polytope of a digraph (Q1915807) (← links)
• Regular random choice and the triangle inequalities (Q2087563) (← links)
• Multinomial models with linear inequality constraints: overview and improvements of computational methods for Bayesian inference (Q2332837) (← links)
• How to recycle your facets (Q2506820) (← links)
• A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
• Spectra of symmetrized shuffling operators (Q2925678) (← links)
• Optimal Mechanism Design for a Sequencing Problem with Two-Dimensional Types (Q2957467) (← links)
• A branch-and-cut algorithm for a resource-constrained scheduling problem (Q3004200) (← links)
• The strongest facets of the acyclic subgraph polytope are unknown (Q4645939) (← links)
• Outranking Relations: Do They Have Special Properties? (Q4883192) (← links)
• Peter C. Fishburn (1936--2021) (Q5919137) (← links)
• Human centered processes and decision support systems (Q5953320) (← links)
• Derivations of large classes of facet defining inequalities of the weak order polytope using ranking structures (Q6084673) (← links)
• Adjacencies on random ordering polytopes and flow polytopes (Q6134082) (← links)
• Solving the Kemeny ranking aggregation problem with quantum optimization algorithms (Q6139170) (← links)