Samuel Fiorini
Université libre de Bruxelles
166 Papers
1.1K Citations
Samuel Fiorini is an academic researcher from Université libre de Bruxelles. The author has contributed to research in topics: Polytope & Approximation algorithm. The author has an hindex of 23, co-authored 162 publications. Previous affiliations of Samuel Fiorini include HEC Montréal & Acadia University.
Chat about Author
Papers
Extended Formulations for Order Polytopes through Network Flows.
Clintin P. Davis-Stober,Jean-Paul Doignon,Samuel Fiorini,François Glineur,Michel Regenwetter +4 more
TL;DR: In this paper, the authors propose an extended formulation of the probabilistic choice model based on linear, weak, semi-and interval orders, which is more parsimonious than descriptions obtained by standard methods for large numbers of choice alternatives.
The facets and the symmetries of the approval-voting polytope
Jean-Paul Doignon,Samuel Fiorini +1 more
TL;DR: Here, it is proved that the facets of this polytope correspond in a natural way to certain antichains in a power set.
Combinatorial bounds on nonnegative rank and extended formulations
Samuel Fiorini,Volker Kaibel,Kanstantsin Pashkovich,Kanstantsin Pashkovich,Dirk Oliver Theis +4 more
TL;DR: It is proved that both the cube as well as the Birkhoff polytope do not admit extended formulations with fewer inequalities than these polytopes have facets, and it is shown that every extended formulation of a d -dimensional neighborlypolytope with Ω ( d 2 ) vertices has size.
The Stackelberg Minimum Spanning Tree Game
Jean Cardinal,Erik D. Demaine,Samuel Fiorini,Gwenaël Joret,Stefan Langerman,Ilan Newman,Oren Weimann +6 more
TL;DR: In this paper, the Stackelberg Minimum Spanning Tree game (StackMST) was considered, and the first player chooses an assignment of prices to the blue edges, and then buys the cheapest possible minimum spanning tree, using any combination of red and blue edges.
A note on the Cops & Robber game on graphs embedded in non-orientable surfaces
TL;DR: This work considers the two-player, complete information game of Cops and Robber played on undirected, finite, reflexive graphs, and gives the bound $$tilde c(g) \in O(g)}$$ with a weak constant and poses the question whether a stronger bound can be obtained.