Adjacencies on random ordering polytopes and flow polytopes.

The Multiple Choice Polytope (MCP) is the prediction range of a random utility model due to Block and Marschak(1960). Fishburn(1998) offers a nice survey of the findings on random utility models at the time. A complete characterization of the MCP is a remarkable achievement of Falmagne (1978). To derive a more enlightening proof of Falmagne Theorem, Fiorini(2004) assimilates the MCP with the flow polytope of some acyclic network. However, apart from a recognition of the facets by Suck(2002), the geometric structure of the MCP was apparently not much investigated. We characterize the adjacency of vertices and the adjacency of facets. Our characterization of the edges of the MCP helps understand recent findings in economics papers such as Chang, Narita and Saito(2022) and Turansick(2022). Moreover, our results on adjacencies also hold for the flow polytope of any acyclic network. In particular, they apply not only to the MCP, but also to three polytopes which Davis-Stober, Doignon, Fiorini, Glineur and Regenwetter (2018) introduced as extended formulations of the weak order polytope, interval order polytope and semiorder polytope (the prediction ranges of other models, see for instance Fishburn and Falmagne, 1989, and Marley and Regenwetter, 2017). [Display omitted] • A characterization of the adjacencies of vertices on the Multiple Choice Polytope • A characterization of the adjacencies of facets on the Multiple Choice Polytope • An investigation of the geometric structure of flow polytopes. [ABSTRACT FROM AUTHOR]