On optimal matching measures for matching problems related to the euclidean distance
We deal with an optimal matching problem, that is, we want to transport two measures to a given place (the target set) where they will match, minimizing the total transport cost that in our case is given by the sum of two different multiples of the Euclidean distance that each measure is transported...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | JOUR |
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_08627959_v139_n4_p553_Mazon |
| Aporte de: |
| Sumario: | We deal with an optimal matching problem, that is, we want to transport two measures to a given place (the target set) where they will match, minimizing the total transport cost that in our case is given by the sum of two different multiples of the Euclidean distance that each measure is transported. We show that such a problem has a solution with an optimal matching measure supported in the target set. This result can be proved by an approximation procedure using a p-Laplacian system. We prove that any optimal matching measure for this problem is supported on the boundary of the target set when the two multiples that affect the Euclidean distances involved in the cost are different. Moreover, we present simple examples showing uniqueness or non-uniqueness of the optimal measure. |
|---|