The entropic regularization of the monge problem on the real line

We study the entropic regularization of the optimal transport problem in dimension 1 when the cost function is the distance c (x, y) = | y - x |.The selected plan at the limit is, among those which are optimal for the nonpenalized problem, the most "diffuse" one on the zones where it may have a density.