[1] M. Agueh and G. Carlier. Barycenters in the Wasserstein space. SIAM Journal on Mathematical Analysis, 43(2):904-924, 2011.
[2] J. Altschuler, J. Niles-Weed, and P. Rigollet. Near-linear time approximation algorithms for optimal transport via sinkhorn iteration. Advances in neural information processing systems, 30, 2017.
[3] J. M. Altschuler and E. Boix-Adsera. Wasserstein barycenters can be computed in polynomial time in fixed dimension. The Journal of Machine Learning Research, 22(1):2000–2018, 2021.
[4] J. M. Altschuler and E. Boix-Adsera. Wasserstein barycenters are np-hard to compute. SIAM Journal on Mathematics of Data Science, 4(1):179–203, 2022.
[5] M. Ballu, Q. Berthet, and F. Bach. Stochastic optimization for regularized Wasserstein estimators. In International Conference on Machine Learning, pages 602-612. PMLR, 2020.
[6] H. H. Bauschke and P. L. Combettes. Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer, 2017.
[7] J.-D. Benamou, G. Carlier, M. Cuturi, L. Nenna, and G. Peyré. Iterative bregman projections for regularized transportation problems. SIAM Journal on Scientific Computing, 37(2):A1111-A1138, 2015.
[8] E. Bernton, P. E. Jacob, M. Gerber, and C. P. Robert. On parameter estimation with the Wasserstein distance. Information and Inference: A Journal of the IMA, 8(4):657-676, 2019.
[9] J. Bigot, E. Cazelles, and N. Papadakis. Data-driven regularization of Wasserstein barycenters with an application to multivariate density registration. Information and Inference: A Journal of the IMA, 8(4):719-755, 2019.
[10] J. Bigot, E. Cazelles, and N. Papadakis. Penalization of barycenters in the Wasserstein space. SIAM Journal on Mathematical Analysis, 51(3):2261-2285, 2019.
[11] G. Carlier and I. Ekeland. Matching for teams. Economic theory, pages 397-418, 2010.
[12] G. Carlier, K. Eichinger, and A. Kroshnin. Entropic-Wasserstein barycenters: Pde characterization, regularity, and clt. SIAM Journal on Mathematical Analysis, 53(5):5880-5914, 2021.
[13] P. Cattiaux, A. Guillin, and L.-M. Wu. A note on talagrand's transportation inequality and logarithmic sobolev inequality. *Probability theory and related fields*, 148:285-304, 2010.
[14] Y. Chen, T. T. Georgiou, and M. Pavon. Stochastic control liaisons: Richard sinkhorn meets gaspard monge on a Schrodinger bridge. Siam Review, 63(2):249-313, 2021.
[15] S. Chewi and A.-A. Pooladian. An entropic generalization of caffarelli's contraction theorem via covariance inequalities. arXiv preprint arXiv:2203.04954, 2022.
[16] P.-A. Chiappori, R. J. McCann, and L. P. Nesheim. Hedonic price equilibria, stable matching, and optimal transport: equivalence, topology, and uniqueness. *Economic Theory*, pages 317-354, 2010.
[17] L. Chizat. Doubly regularized entropic Wasserstein barycenters. arXiv preprint arXiv:2303.11844, 2023.
[18] S. Cohen, M. Arbel, and M. P. Deisenroth. Estimating barycenters of measures in high dimensions. arXiv preprint arXiv:2007.07105, 2020.
[19] N. Courty, R. Flamary, A. Habrard, and A. Rakotomamonjy. Joint distribution optimal transportation for domain adaptation. Advances in neural information processing systems, 30, 2017.
[20] M. Cuturi. Sinkhorn distances: Lightspeed computation of optimal transport. Advances in neural information processing systems, 26, 2013.