activity
20082022
most citedKnowledge Spaces and Learning Spaces

6 citations · 10 across the 5 of their papers we have counts for

collaborators

10 papers

math.CO2022★ 1 cited

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…

math.CO2021

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…

cs.DS2018

Finding a Maximum-Weight Convex Set in a Chordal Graph

Jean Cardinal, Jean-Paul Doignon, Keno Merckx

We consider a natural combinatorial optimization problem on chordal graphs, the class of graphs with no induced cycle of length four or more. A subset of vertices of a chordal grap…

math.OC2017

Extended Formulations for Order Polytopes through Network Flows

Clintin P. Davis-Stober, Jean-Paul Doignon, Samuel Fiorini +2

Mathematical psychology has a long tradition of modeling probabilistic choice via distribution-free random utility models and associated random preference models. For such models,…

math.CO2016

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…

cs.DM2015

On the shelling antimatroids of split graphs

Jean Cardinal, Jean-Paul Doignon, Keno Merckx

Chordal graph shelling antimatroids have received little attention with regard to their combinatorial properties and related optimization problems, as compared to the case of poset…

math.CO2015★ 6 cited

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,…

math.CO2015

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…

math.CO2008★ 3 cited

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…

math-ph2008

Note: Axiomatic Derivation of the Doppler Factor and Related Relativistic Laws

Jean-Claude Falmagne, Jean-Paul Doignon

The formula for the relativistic Doppler effect is investigated in the context of two compelling invariance axioms. The axioms are expressed in terms of an abstract operation gener…