Induced binary probabilities and the linear ordering polytope: A status report
From MaRDI portal
Publication:1184362
DOI10.1016/0165-4896(92)90038-7zbMath0751.90004OpenAlexW2054965643MaRDI QIDQ1184362
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)90038-7
Related Items
More facets from fences for linear ordering and acyclic subgraph polytopes, Binary choice, subset choice, random utility, and ranking: a unified perspective using the permutahedron, Bayes factors for state-trace analysis, A survey on the linear ordering problem for weighted or unweighted tournaments, The random utility model with an infinite choice space, An approval-voting polytope for linear orders, Probabilistic biclassification and random variable representations, On the partial order polytope of a digraph, Derivations of large classes of facet defining inequalities of the weak order polytope using ranking structures, A semidefinite optimization approach to the target visitation problem, Optimal Mechanism Design for a Sequencing Problem with Two-Dimensional Types, Adjacencies on random ordering polytopes and flow polytopes, Solving the Kemeny ranking aggregation problem with quantum optimization algorithms, Facets of linear signed order polytopes., Weak order polytopes., Proportional scheduling, split-proofness, and merge-proofness, A selective review of recent characterizations of stochastic choice models using distribution and functional equation techniques, Generalizing the concept of binary choice systems induced by rankings: One way of probabilizing deterministic measurement structures, Geometric and combinatorial properties of the polytope of binary choice probabilities, Revealed stochastic preference: a one-paragraph proof and generalization, A branch-and-cut algorithm for a resource-constrained scheduling problem, The strongest facets of the acyclic subgraph polytope are unknown, An updated survey on the linear ordering problem for weighted or unweighted tournaments, The biorder polytope, Human centered processes and decision support systems, How to recycle your facets, New semidefinite programming relaxations for the linear ordering and the traveling salesman problem, Regular choice systems: a general technique to represent them by random variables, Peter C. Fishburn (1936--2021), Spectra of Symmetrized Shuffling Operators, Choosing from a weighted tournament, Analysis of multinomial models under inequality constraints: applications to measurement theory, Regular random choice and the triangle inequalities, Multinomial models with linear inequality constraints: overview and improvements of computational methods for Bayesian inference, Ordinal distributions associated to 3-monotone matrices, Optimal facility layout design, Signed orders, choice probabilities, and linear polytopes, Random relations, random utilities, and random functions, Unimodal binary distributions, Outranking Relations: Do They Have Special Properties?, A combinatorial study of partial order polytopes, Random utility models and their applications: Recent developments, Independent random utility representations, A general concept of majority rule
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random utility representation of binary choice probabilities: A new class of necessary conditions
- 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
- Mixed models, random utilities, and the triangle inequality
- Decomposing weighted digraphs into sums of chains
- A game-theoretic approach to the binary stochastic choice problem
- Mixtures of order matrices and generalized order matrices
- Binary choice probabilities and rankings
- A necessary but insufficient condition for the stochastic binary choice problem
- Facets of the linear ordering polytope
- Facets of the Asymmetric Traveling Salesman Polytope
- Maximum likelihood paired comparison ranking by linear programming
- Permutation Polyhedra
- Binary Probabilities Induced by Rankings
