Extended formulations for order polytopes through network flows
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...
Main Authors: | Davis-Stober, C.P (Author), Doignon, J.-P (Author), Fiorini, S. (Author), Glineur, F. (Author), Regenwetter, M. (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
Academic Press Inc.
2018
|
Subjects: | |
Online Access: | View Fulltext in Publisher |
Similar Items
-
Faces of 2-Dimensional Simplex of Order and Chain Polytopes
by: Aki Mori
Published: (2019-09-01) -
Cutting Convex Polytopes by Hyperplanes
by: Takayuki Hibi, et al.
Published: (2019-04-01) -
A Uniform Asymptotical Upper Bound for the Variance of a Random Polytope in a Simple Polytope
by: A. Magazinov
Published: (2015-03-01) -
Gale Duality and the Neighborliness of Random Polytopes. II
by: A. G. Brodskiy
Published: (2015-02-01) -
Characteristics of Complexity: Clique Number of a Polytope Graph and Rectangle Covering Number
by: A. N. Maksimenko
Published: (2014-10-01)