Robust matching for teams
From MaRDI portal
Publication:6191110
DOI10.1007/s10957-023-02349-3MaRDI QIDQ6191110
Unnamed Author, Bahman Gharesifard
Publication date: 9 February 2024
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the Monge-Kantorovich problem with additional linear constraints
- On a problem of optimal transport under marginal martingale constraints
- On the relation between optimal transport and Schrödinger bridges: a stochastic control viewpoint
- Matching for teams
- Hedonic price equilibria, stable matching, and optimal transport: Equivalence, topology, and uniqueness
- The nonatomic assignment model
- A multi-objective interpretation of optimal transport
- Competitive advertising under uncertainty: a stochastic differential game approach
- Sisterhood in the Gale-Shapley matching algorithm
- Instability of martingale optimal transport in dimension \(\mathrm{d}\ge 2\)
- Multi-species optimal transportation
- Dual attainment for the martingale transport problem
- A stochastic control approach to no-arbitrage bounds given marginals, with an application to lookback options
- The assignment game. I: The core
- On a problem of Monge
- Theory and Applications of Robust Optimization
- An optimal matching problem
- Control to Flocking of the Kinetic Cucker--Smale Model
- Optimal Transportation with Traffic Congestion and Wardrop Equilibria
- Multi‐to One‐Dimensional Optimal Transport
- Model-Free Hedging
- Optimal transportation with capacity constraints
- The Existence of Probability Measures with Given Marginals
- Minimax Theorems
- College Admissions and the Stability of Marriage
- Optimal Transport for a Class of Linear Quadratic Differential Games
This page was built for publication: Robust matching for teams
