Matching for teams
From MaRDI portal
Recommendations
- Team selection factor pricing with discrete and inhomogeneous factors
- An optimal matching problem
- Bargaining and Competition in Matching Markets
- Hedonic price equilibria, stable matching, and optimal transport: Equivalence, topology, and uniqueness
- Numerical methods for matching for teams and Wasserstein barycenters
Cites work
- An optimal matching problem
- Hedonic price equilibria, stable matching, and optimal transport: Equivalence, topology, and uniqueness
- scientific article; zbMATH DE number 2134650 (Why is no real title available?)
- scientific article; zbMATH DE number 3441151 (Why is no real title available?)
- scientific article; zbMATH DE number 1909499 (Why is no real title available?)
- Mass transportation problems. Vol. 1: Theory. Vol. 2: Applications
- Polar factorization and monotone rearrangement of vector‐valued functions
Cited in
(59)- An optimal matching problem with constraints
- Variational methods for tomographic reconstruction with few views
- Team formation: Matching quality supply and quality demand.
- Geometry of Kantorovich polytopes and support of optimizers for repulsive multi-marginal optimal transport on finite state spaces
- The geometry of multi-marginal Skorokhod embedding
- Variational problems involving unequal dimensional optimal transport
- An optimal transport approach for the Schrödinger bridge problem and convergence of Sinkhorn algorithm
- Understanding the topology and the geometry of the space of persistence diagrams via optimal partial transport
- Equilibrium in quality markets, beyond the transferable case
- Interpolating between matching and hedonic pricing models
- Simple approximative algorithms for free-support Wasserstein barycenters
- Breaking the Curse of Dimension in Multi-Marginal Kantorovich Optimal Transport on Finite State Spaces
- Elements of statistical inference in 2-Wasserstein space
- Barycenters for the Hellinger-Kantorovich distance over \(\mathbb{R}^d\)
- Discrete Wasserstein barycenters: optimal transport for discrete data
- THE MULTI-MARGINAL OPTIMAL PARTIAL TRANSPORT PROBLEM
- Numerical methods for matching for teams and Wasserstein barycenters
- Multi-marginal optimal transport and multi-agent matching problems: uniqueness and structure of solutions
- Measure-Valued Spline Curves: An Optimal Transport Viewpoint
- On the uniqueness and numerical approximations for a matching problem
- Matching information
- Multi-marginal optimal transportation problem for cyclic costs
- Wasserstein barycenters over Riemannian manifolds
- Wasserstein Barycenters Are NP-Hard to Compute
- On the linear convergence of the multimarginal Sinkhorn algorithm
- Stochastic gradient methods for \(L^2\)-Wasserstein least squares problem of Gaussian measures
- Tomographic reconstruction from a few views: a multi-marginal optimal transport approach
- On \(c\)-cyclical monotonicity for optimal transport problem with Coulomb cost
- Gradient projection methods for the $n$-coupling problem
- A simple counterexample to the Monge ansatz in multimarginal optimal transport, convex geometry of the set of Kantorovich plans, and the Frenkel-Kontorova model
- Iterative Bregman projections for regularized transportation problems
- Learning to match via inverse optimal transport
- Polynomial-time algorithms for multimarginal optimal transport problems with structure
- Balancing stability and efficiency in team formation as a generalized roommate problem
- A family of pairwise multi-marginal optimal transports that define a generalized metric
- Monge solutions and uniqueness in multi-marginal optimal transport via graph theory
- Online team formation under different synergies
- Unbalanced multi-marginal optimal transport
- Generalized Wasserstein barycenters between probability measures living on different subspaces
- Robust matching for teams
- Limit theorems for entropic optimal transport maps and Sinkhorn divergence
- Wasserstein medians: robustness, PDE characterization, and numerics
- On the local structure of optimal measures in the multi-marginal optimal transportation problem
- A general framework for multi-marginal optimal transport
- p-Wasserstein barycenters
- Constrained Hellinger-Kantorovich barycenters: least-cost soft and conic multimarginal formulations
- Extremal structures and uniqueness of multimarginal optimal transportation via two-marginal reduction
- Multicausal transport: barycenters and dynamic matching
- Mathematical imaging and surface processing. Abstracts from the workshop held February 2--7, 2025
- h-Wasserstein barycenters
- Sensitivity analysis of Wasserstein distributionally robust optimization problems
- Tangential fixpoint iterations for Gromov-Wasserstein barycenters
- Sufficiency of c-cyclical monotonicity in a class of multi-marginal optimal transport problems
- Convergence rate of entropy-regularized multi-marginal optimal transport costs
- General duality and dual attainment for adapted transport
- A new perspective on denoising based on optimal transport
- Grand-canonical optimal transport
- Optimal partition of a large labor force into working pairs
- Hedonic price equilibria, stable matching, and optimal transport: Equivalence, topology, and uniqueness
This page was built for publication: Matching for teams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q847810)
