Search

This work deals with a problem of assigning periodic tasks to employees in such a way that each employee performs each task with the same frequency in the long term. The motivation comes from a collaboration with the SNCF, the main French railway company. An almost complete solution is provided under the form of a necessary and sufficient condition that can be checked in polynomial time. A complementary discussion about possible extensions is also proposed.

In a digraph, a quasi-kernel is a subset of vertices that is independent and such that the shortest path from every vertex to this subset is of length at most two. The ``small quasi-kernel conjecture,'' proposed by Erd\H{o}s and Sz\'ekely in 1976, postulates that every sink-free digraph has a quasi-kernel whose size is within a fraction of the total number of vertices. The conjecture is even more precise with a $1/2$ ratio, but even with larger ratio, this property is known to hold only for few classes of graphs. The focus here is on small quasi-kernels in split graphs. This family of graphs has played a special role in the study of the conjecture since it was used to disprove a strengthening that postulated the existence of two disjoint quasi-kernels. The paper proves that every sink-free split digraph $D$ has a quasi-kernel of size at most $\frac{2}{3}|V(D)|$, and even of size at most two when the graph is an orientation of a complete split graph. It is also shown that computing a quasi-kernel of minimal size in a split digraph is W[2]-hard.

Various simplicial complexes can be associated with a graph. Box complexes form an important families of such simplicial complexes and are especially useful for providing lower bounds on the chromatic number of the graph via some of their topological properties. They provide thus a fascinating topic mixing topology and discrete mathematics. This paper is intended to provide an up-do-date survey on box complexes. It is based on classical results and recent findings from the literature, but also establishes new results improving our current understanding of the topic, and identifies several challenging open questions.

In a simple model of assigning workers to tasks, every solution that minimizes the load difference between the most loaded worker and the least loaded one actually minimizes the maximal load and maximizes the minimal load. This can be seen as a consequence of standard results of optimization over polymatroids. We show that similar phenomena still occur in close models, simple to state, and that do not enjoy any polymatroid structure.

Two-stage robust optimization is a fundamental paradigm for modeling and solving optimization problems with uncertain parameters. A now classical method within this paradigm is finite-adaptability, introduced by Bertsimas and Caramanis (IEEE Transactions on Automatic Control, 2010). In this note, we point out that the continuity assumption they stated to ensure the convergence of the method is not correct, and we propose an alternative assumption for which we prove the desired convergence.

Some airlines use the preferential bidding system to construct the schedules of their pilots. In this system, the pilots bid on the different activities and the schedules that lexicographically maximize the scores of the pilots according to their seniority are selected. A sequential approach to solve this maximization problem is natural: the problem is first solved with the bids of the most senior pilot; then it is solved with those of the second most senior without decreasing the score of the most senior, and so on. The literature admits that the structure of the problem somehow imposes such an approach. The problem can be modeled as an integer linear lexicographic program. We propose a new exact method, which relies on column generation for solving its continuous relaxation. To design this column generation, we prove that bounded linear lexicographic programs admit "primal-dual" feasible bases and we show how to compute such bases efficiently. Another contribution on which our exact method relies consists in the extension of standard tools for resource-constrained longest path problems to their lexicographic versions. This is useful in our context since the generation of new columns is modeled as a lexicographic resource-constrained longest path problem. Numerical experiments show that this new method is already able to solve industrial instances provided by Air France, with up to 150 pilots. By adding a last ingredient in the resolution of the longest path problems, which exploits the specificity of the preferential bidding system, the method achieves for these instances computational times that are compatible with operational constraints.

In a digraph, a quasi-kernel is a subset of vertices that is independent and such that every vertex can reach some vertex in that set via a directed path of length at most two. Whereas Chv\'atal and Lov\'asz proved in 1974 that every digraph has a quasi-kernel, very little is known so far about the complexity of finding small quasi-kernels. In 1976 Erd\H{o}s and Sz\'ekely conjectured that every sink-free digraph $D = (V, A)$ has a quasi-kernel of size at most $|V|/2$. Obviously, if $D$ has two disjoint quasi-kernels then it has a quasi-kernel of size at most $|V|/2$, and in 2001 Gutin, Koh, Tay and Yeo conjectured that every sink-free digraph has two disjoint quasi-kernels. Yet, they constructed in 2004 a counterexample, thereby disproving this stronger conjecture. We shall show that, not only sink-free digraphs occasionally fail to contain two disjoint quasi-kernels, but it is computationally hard to distinguish those that do from those that do not. We also prove that the problem of computing a small quasi-kernel is polynomial time solvable for orientations of trees but is computationally hard in most other cases (and in particular for restricted acyclic digraphs).

We study the problem of dividing a multi-layered cake under non-overlapping constraints. This problem, recently proposed by Hosseini et al. (IJCAI, 2020), captures several natural scenarios such as the allocation of multiple facilities over time where each agent can utilize at most one facility simultaneously, and the allocation of tasks over time where each agent can perform at most one task simultaneously. We establish the existence of an envy-free multi-division that is both non-overlapping and contiguous within each layer when the number of agents is a prime power and the number of layers is at most the number of agents, providing a positive partial answer to an open question by Hosseini et al. To achieve this, we employ a new approach based on a general fixed point theorem, originally proven by Volovikov (1996), and recently applied by Joji\'{c}, Panina, and \v{Z}ivaljevi\'{c} (2020) to the envy-free division problem of a cake. We further design a fully polynomial-time approximation scheme (FPTAS) to find an approximate envy-free solution that is both non-overlapping and contiguous for a two-layered cake division among three agents with monotone preferences. More generally, we establish all the results for divisions among groups of almost the same size. When there are three groups and one layer, our FPTAS is actually able to deal with groups of any predetermined sizes, still under the monotone preference assumptions. For three groups, this provides thus an algorithmic version of a recent theorem by Segal-Halevi and Suksompong (2021). A classical lemma from topology ensures that every self-map of a simplex mapping each facet to itself is surjective. This lemma has often been used in economics theory and our algorithm can be interpreted as an FPTAS counterpart of its two-dimensional version., Comment: A preliminary version of this paper appeared in the Proceedings of the 17th Conference on Web and Internet Economics (WINE 2021). This version extends all the previous results to the group version and contains a new section with several results for proportionality (Section 5)

Commutative properties in formal languages pose problems at the frontier of computer science, computational linguistics and computational group theory. A prominent problem of this kind is the position of the language $O_n$, the language that contains the same number of letters $a_i$ and $\bar a_i$ with $1\leq i\leq n$, in the known classes of formal languages. It has recently been shown that $O_n$ is a Multiple Context-Free Language (MCFL). However the more precise conjecture of Nederhof that $O_n$ is an MCFL of dimension $n$ was left open. We present two proofs of this conjecture, both relying on tools from algebraic topology. On our way, we prove a variant of the necklace splitting theorem.

Linear complementarity programming is a generalization of linear programming which encompasses the computation of Nash equilibria for bimatrix games. While the latter problem is PPAD-complete, we show that the tropical analogue of the complementarity problem associated with Nash equilibria can be solved in polynomial time. Moreover, we prove that the Lemke--Howson algorithm carries over the tropical setting and performs a linear number of pivots in the worst case. A consequence of this result is a new class of (classical) bimatrix games for which Nash equilibria computation can be done in polynomial time.

Our purpose is to show that complements of line graphs enjoy nice coloring properties. We show that for all graphs in this class the local and usual chromatic numbers are equal. We also prove a sufficient condition for the chromatic number to be equal to a natural upper bound. A consequence of this latter condition is a complete characterization of all induced subgraphs of the Kneser graph $\operatorname{KG}(n,2)$ that have a chromatic number equal to its chromatic number, namely $n-2$. In addition to the upper bound, a lower bound is provided by Dol'nikov's theorem, a classical result of the topological method in graph theory. We prove the $\operatorname{NP}$-hardness of deciding the equality between the chromatic number and any of these bounds. The topological method is especially suitable for the study of coloring properties of complements of line graphs of hypergraphs. Nevertheless, all proofs in this paper are elementary and we also provide a short discussion on the ability for the topological methods to cover some of our results.

Haviv ({\em European Journal of Combinatorics}, 2019) has recently proved that some topological lower bounds on the chromatic number of graphs are also lower bounds on their orthogonality dimension over $\mathbb{R}$. We show that this holds actually for all known topological lower bounds and all fields. We also improve the topological bound he obtained for the minrank parameter over $\mathbb{R}$ -- an important graph invariant from coding theory -- and show that this bound is actually valid for all fields as well. The notion of independent representation over a matroid is introduced and used in a general theorem having these results as corollaries. Related complexity results are also discussed., Comment: 7 pages

Given a simplicial complex and a collection of subcomplexes covering it, the nerve theorem, a fundamental tool in topological combinatorics, guarantees a certain connectivity of the simplicial complex when connectivity conditions on the intersection of the subcomplexes are satisfied. We show that it is possible to extend this theorem by replacing some of these connectivity conditions on the intersection of the subcomplexes by connectivity conditions on their union. While this is interesting for its own sake, we use this extension to generalize in various ways the Meshulam lemma, a powerful homological version of the Sperner lemma. We also prove a generalization of the Meshulam lemma that is somehow reminiscent of the polytopal generalization of the Sperner lemma by De Loera, Peterson, and Su. For this latter result, we use a different approach and we do not know whether there is a way to get it via a nerve theorem of some kind.

Consider $n$ players having preferences over the connected pieces of a cake, identified with the interval $[0,1]$. A classical theorem, found independently by Stromquist and by Woodall in 1980, ensures that, under mild conditions, it is possible to divide the cake into $n$ connected pieces and assign these pieces to the players in an envy-free manner, i.e, such that no player strictly prefers a piece that has not been assigned to her. One of these conditions, considered as crucial, is that no player is happy with an empty piece. We prove that, even if this condition is not satisfied, it is still possible to get such a division when $n$ is a prime number or is equal to $4$. When $n$ is at most $3$, this has been previously proved by Erel Segal-Halevi, who conjectured that the result holds for any $n$. The main step in our proof is a new combinatorial lemma in topology, close to a conjecture by Segal-Halevi and which is reminiscent of the celebrated Sperner lemma: instead of restricting the labels that can appear on each face of the simplex, the lemma considers labelings that enjoy a certain symmetry on the boundary.

This paper discusses Tverberg-type theorems with coordinate constraints (i.e., versions of these theorems where all points lie within a subset $S \subset \mathbb{R}^d$ and the intersection of convex hulls is required to have a non-empty intersection with $S$). We determine the $m$-Tverberg number, when $m \geq 3$, of any discrete subset $S$ of $\mathbb{R}^2$ (a generalization of an unpublished result of J.-P. Doignon). We also present improvements on the upper bounds for the Tverberg numbers of $\mathbb{Z}^3$ and $\mathbb{Z}^j \times \mathbb{R}^k$ and an integer version of the well-known positive-fraction selection lemma of J. Pach., Comment: 14 pages, 1 figure

In a directed graph, a kernel is a subset of vertices that is both stable and absorbing. Not all digraphs have a kernel, but a theorem due to Boros and Gurvich guarantees the existence of a kernel in every clique-acyclic orientation of a perfect graph. However, an open question is the complexity status of the computation of a kernel in such a digraph. Our main contribution is to prove new polynomiality results for subfamilies of perfect graphs, among which are claw-free perfect graphs and chordal graphs. Our results are based on the design of kernel computation methods with respect to two graph operations: clique-cutset decomposition and augmentation of flat edges. We also prove that deciding the existence of a kernel - and computing it if it exists - is polynomial in every orientation of a chordal or a circular-arc graph, even not clique-acyclic.

We propose a general technique related to the polytopal Sperner lemma for proving old and new multilabeled versions of Sperner's lemma. A notable application of this technique yields a cake-cutting theorem where the number of players and the number of pieces can be independently chosen. We also prove multilabeled versions of Fan's lemma, a combinatorial analogue of the Borsuk-Ulam theorem, and exhibit applications to fair division and graph coloring., Comment: 21 pages, 2 figures

Aircraft routing and crew pairing problems aims at building the sequences of flight legs operated respectively by airplanes and by crews of an airline. Given their impact on airlines operating costs, both have been extensively studied for decades. Our goal is to provide reliable and easy to maintain frameworks for both problems at Air France. We propose simple approaches to deal with Air France current setting. For routing, we introduce a compact MIP formulation that can be solved by current MIP solvers in at most a few minutes even on Air France largest instances. Regarding crew pairing, we provide a standard methodology to model the column generation pricing subproblem within a new resource constrained shortest path framework recently introduced by the first author. This new framework, which can be used as a black-box, leverages on bounds on paths' resource to discard partial solutions and speed-up the resolution. The resulting approach enables to solve to optimality Air France largest instances. Recent literature has focused on integrating aircraft routing and crew pairing problems. As a side result, we have been able to solve to near optimality large industrial instances of the integrated problem by combining the aforementioned algorithms within a simple cut generating method.

We discuss five discrete results: the lemmas of Sperner and Tucker from combinatorial topology and the theorems of Carath\'eodory, Helly, and Tverberg from combinatorial geometry. We explore their connections and emphasize their broad impact in application areas such as game theory, graph theory, mathematical optimization, computational geometry, etc.

Consider a terminal in which users arrive continuously over a finite period of time at a variable rate known in advance. A fleet of shuttles has to carry the users over a fixed trip. What is the shuttle schedule that minimizes their waiting time? This is the question addressed in the present paper. We propose efficient algorithms for several variations of this question with proven performance guarantees. The techniques used are of various types (convex optimization, shortest paths,...). The paper ends with numerical experiments showing that most of our algorithms behave also well in practice., Comment: 25 pages, 2 figures

This paper deals with two problems about splitting fairly a path with colored vertices, where "fairly" means that each part contains almost the same amount of vertices in each color. Our first result states that it is possible to remove one vertex per color from a path with colored vertices so that the remaining vertices can be fairly split into two independent sets of the path. It implies in particular a conjecture of Ron Aharoni and coauthors. The proof uses the octahedral Tucker lemma. Our second result is the proof of a particular case of a conjecture of D{\"o}m{\"o}t{\"o}r P{\'a}lv{\"o}lgyi about fair splittings of necklaces for which one can decide which thieves are advantaged. The proof is based on a rounding technique introduced by Noga Alon and coauthors to prove the discrete splitting necklace theorem from the continuous one.

Given the subjective preferences of n roommates in an n-bedroom apartment, one can use Sperner's lemma to find a division of the rent such that each roommate is content with a distinct room. At the given price distribution, no roommate has a strictly stronger preference for a different room. We give a new elementary proof that the subjective preferences of only n-1 of the roommates actually suffice to achieve this envy-free rent division. Our proof, in particular, yields an algorithm to find such a fair division of rent. The techniques also give generalizations of Sperner's lemma including a new proof of a conjecture of the third author., Comment: v2: additional coauthor, significantly expanded version with new results. 11 pages, 2 figures. v1: Supplemental material for the PBS Infinite Series episode "Splitting Rent with Triangles", available at https://www.youtube.com/watch?v=48oBEvpdYSE . 4 pages, 2 figures