2 papers
cs.GT2026
Resolving Envy by Adding Goods with Bounded Supply: A Type-Count Dichotomy and Two-Agent Hardness
Chuang-Chieh Lin, Guillaume Fertin, Po-An Chen +4
We study envy elimination by adding goods (EEAG) when the additional pool has bounded supply and no separate budget bound. We establish a sharp type-count dichotomy for binary addi…
cs.DS2022
Sorting Genomes by Prefix Double-Cut-and-Joins
Guillaume Fertin, Géraldine Jean, Anthony Labarre
In this paper, we study the problem of sorting unichromosomal linear genomes by prefix double-cut-and-joins (or DCJs) in both the signed and the unsigned settings. Prefix DCJs cut…