Adjacencies on random ordering polytopes and flow polytopes

DOI10.1016/j.jmp.2023.102768zbMath1520.91110arXiv2207.06925OpenAlexW4362454806MaRDI QIDQ6134082

Kota Saito, Jean-Paul Doignon

Publication date: 25 July 2023

Published in: Journal of Mathematical Psychology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.06925

zbMATH Keywords

random utility modelsflow polytopesadjacency of verticesadjacency of facetsmultiple choice polytope

Mathematics Subject Classification ID

Decision theory (91B06)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
• Regular choice systems: a general technique to represent them by random variables
• Facets of the \((s,t)-p\)-path polytope
• An updated survey on the linear ordering problem for weighted or unweighted tournaments
• Analysis of multinomial models under inequality constraints: applications to measurement theory
• Hamiltonicity and combinatorial polyhedra
• Induced binary probabilities and the linear ordering polytope: A status report
• The stochastic choice problem: A game-theoretic approach
• A representation theorem for finite random scale systems
• Weak order polytopes.
• A short proof of a theorem of Falmagne.
• Binary choice probabilities and rankings
• Extended formulations for order polytopes through network flows
• The diameters of network-flow polytopes satisfy the Hirsch conjecture
• Adjacency on combinatorial polyhedra
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Independent random utility representations
• A general concept of majority rule
• Identification in the random utility model
• Bayesian inference and model comparison for random choice structures
• Intransitive indifference with unequal indifference intervals
• Semiorders and a Theory of Utility Discrimination
• Maximum-Minimum Sätze über Graphen
• Falmagne and the Rationalizability of Stochastic Choices in Terms of Random Orderings
• New Handbook of Mathematical Psychology
• Combinatorial optimization. Theory and algorithms.

This page was built for publication: Adjacencies on random ordering polytopes and flow polytopes