6 citations · 10 across the 5 of their papers we have counts for
6 papers · 1 filter
Adjacencies on random ordering polytopes and flow polytopes
Jean-Paul Doignon, Kota Saito
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 rando…
Resolutions of Convex Geometries
Domenico Cantone, Jean-Paul Doignon, Alfio Giarlotta +1
Convex geometries (Edelman and Jamison, 1985) are finite combinatorial structures dual to union-closed antimatroids or learning spaces. We define an operation of resolution for con…
Any Finite Group is the Group of Some Binary, Convex Polytope
Jean-Paul Doignon
For any given finite group, Schulte and Williams (2015) establish the existence of a convex polytope whose combinatorial automorphisms form a group isomorphic to the given group. W…
Knowledge Spaces and Learning Spaces
Jean-Paul Doignon, Jean-Claude Falmagne
How to design automated procedures which (i) accurately assess the knowledge of a student, and (ii) efficiently provide advices for further study? To produce well-founded answers,…
Primary Facets Of Order Polytopes
Jean-Paul Doignon, Selim Rexhep
Mixture models on order relations play a central role in recent investigations of transitivity in binary choice data. In such a model, the vectors of choice probabilities are the c…
Weighted graphs defining facets: a connection between stable set and linear ordering polytopes
Jean-Paul Doignon, Samuel Fiorini, Gwenaël Joret
A graph is alpha-critical if its stability number increases whenever an edge is removed from its edge set. The class of alpha-critical graphs has several nice structural properties…