Extended Formulations for Order Polytopes through Network Flows
Clintin P. Davis-Stober, Jean-Paul Doignon, Samuel Fiorini,, Fran\c{c}ois Glineur, Michel Regenwetter

TL;DR
This paper introduces extended formulations using network flow models to efficiently describe the complex polytopes of probabilistic choice models in mathematical psychology, enabling scalable analysis for many alternatives.
Contribution
It develops network flow-based extended formulations for choice polytopes, overcoming combinatorial complexity limits of previous methods.
Findings
Extended formulations simplify polytope descriptions for many choice alternatives.
Network flow models provide more parsimonious representations than standard methods.
Facilitates computational testing of probabilistic choice models on larger datasets.
Abstract
Mathematical psychology has a long tradition of modeling probabilistic choice via distribution-free random utility models and associated random preference models. For such models, the predicted choice probabilities often form a bounded and convex polyhedral set, or polytope. Polyhedral combinatorics have thus played a key role in studying the mathematical structure of these models. However, standard methods for characterizing the polytopes of such models are subject to a combinatorial explosion in complexity as the number of choice alternatives increases. Specifically, this is the case for random preference models based on linear, weak, semi- and interval orders. For these, a complete, linear description of the polytope is currently known only for, at most, 5--8 choice alternatives. We leverage the method of extended formulations to break through those boundaries. For each of the four…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
