0
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      Extended formulations for order polytopes through network flows

      , , , ,
      Journal of Mathematical Psychology
      Elsevier BV

      Read this article at

      ScienceOpenPublisherPMC
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          <p class="first" id="P1">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 types of preferences, we build an appropriate network, and show that the associated network flow polytope provides an extended formulation of the polytope of the choice model. This extended formulation has a simple linear description that is more parsimonious than descriptions obtained by standard methods for large numbers of choice alternatives. The result is a computationally less demanding way of testing the probabilistic choice model on data. We sketch how the latter interfaces with recent developments in contemporary statistics. </p>

          Related collections

          Author and article information

          Journal
          Journal of Mathematical Psychology
          Journal of Mathematical Psychology
          Elsevier BV
          00222496
          December 2018
          December 2018
          : 87
          : 1-10
          Article
          10.1016/j.jmp.2018.08.003
          6426318
          30906069
          915f656b-1ab0-4b8e-a86b-0c212bffa653
          © 2018

          https://www.elsevier.com/tdm/userlicense/1.0/

          History

          Comments

          Comment on this article

          scite_

          Similar content2,262