21 citations · 64 across the 25 of their papers we have counts for
4 papers · 1 filter
Computing solutions of the multiclass network equilibrium problem with affine cost functions
Frédéric Meunier, Thomas Pradeau
We consider a nonatomic congestion game on a graph, with several classes of players. Each player wants to go from its origin vertex to its destination vertex at the minimum cost an…
Hedetniemi's conjecture for Kneser hypergraphs
Hossein Hajiabolhassan, Frédéric Meunier
One of the most famous conjecture in graph theory is Hedetniemi's conjecture stating that the chromatic number of the categorical product of graphs is the minimum of their chromati…
Stochastic Shortest Paths and Risk Measures
Axel Parmentier, Frédéric Meunier
We consider three shortest path problems in directed graphs with random arc lengths. For the first and the second problems, a risk measure is involved. While the first problem cons…
Colorful linear programming, Nash equilibrium, and pivots
Frédéric Meunier, Pauline Sarrabezolles
The colorful Carathéodory theorem, proved by Bárány in 1982, states that given d+1 sets of points S_1,...,S_{d+1} in R^d, with each S_i containing 0 in its convex hull, there exist…