1 citations · 1 across the 6 of their papers we have counts for
7 papers
Faster Algorithms for the Least-Core value and the Nucleolus in Convex Games
Giacomo Maggiorano, Alessandro Sosso, Gautier Stauffer
The nucleolus is a central solution concept in cooperative game theory. While its computation is NP-hard in general, it can be computed in polynomial time for convex games; however…
On the Nucleolus of a Class of Linear Production Games
Mourad Baïou, Gianpaolo Oriolo, Gautier Stauffer
We study the nucleolus in a class of cooperative games where agents collaborate by sharing demands and production-distribution capacities across multiple markets. These production-…
The -path coloring problem in graphs with bounded treewidth: an application in integrated circuit manufacturing
Dehia Ait-Ferhat, Vincent Juliard, Gautier Stauffer +1
In this paper, we investigate the -path coloring problem, a variant of vertex coloring arising in the context of integrated circuit manufacturing. In this setting, typical indus…
DSA-aware multiple patterning for the manufacturing of vias: Connections to graph coloring problems, IP formulations, and numerical experiments
Dehia Ait-Ferhat, Vincent Juliard, Gautier Stauffer +1
In this paper, we investigate the manufacturing of vias in integrated circuits with a new technology combining lithography and Directed Self Assembly (DSA). Optimizing the producti…
How many matchings cover the nodes of a graph?
Dehia Ait Ferhat, Zoltán Király, András Sebő +1
Given an undirected graph, are there matchings whose union covers all of its nodes, that is, a matching--cover? A first, easy polynomial solution from matroid union is possi…
The Stochastic Shortest Path Problem : A polyhedral combinatorics perspective
Matthieu Guillot, Gautier Stauffer
In this paper, we give a new framework for the stochastic shortest path problem in finite state and action spaces. Our framework generalizes both the frameworks proposed by Bertsek…