Abstract
We examine a hedonic model featuring uncertain production costs. The aim is to determine equilibrium prices and wages that facilitate the pairing of consumers with teams of producers, even when faced with the veil of uncertainty shrouding production costs. Using the framework of optimal transport theory, we identify the conditions sufficient for the existence of robust matching equilibrium. Our results show that under an additive uncertainty model for production costs, equilibrium can indeed be achieved, characterized by the expectation of the matching outcome under conditions of certainty. However, this model exhibits a twist of indeterminacy into the matching equilibrium. This departure from determinism is a distinctive feature, emphasizing the unique dynamics arising when uncertainty intersects with equilibrium-seeking mechanisms. To emphasize on this feature, we examine a special case which is related to martingale optimal transport. This case also underscores the complexity inherent in situations where uncertainty governs the equilibrium landscape. Altogether, our results offer a fresh perspective on matching scenarios marked by unpredictability in production costs.
Similar content being viewed by others
Notes
A set Y endowed with the weak topology is said to be weakly compact if any sequence of elements in Y has a weakly convergence subsequence.
References
Adu, D.O.: Optimal transport for averaged control. IEEE Control Syst. Lett. 7, 727–732 (2022)
Adu, D.O., Başar, T., Gharesifard, B.: Optimal transport for a class of linear quadratic differential games. IEEE Trans. Autom. Control 67(11), 6287–6294 (2022)
Schumacher, J.M.: A multi-objective interpretation of optimal transport. J. Optim. Theory Appl. 176(1), 94–119 (2018)
Bacon, X.: Multi-species optimal transportation. J. Optim. Theory Appl. 184(2), 315–337 (2020)
Chen, Y., Georgiou, T.T., Pavon, M.: On the relation between optimal transport and Schrödinger bridges: a stochastic control viewpoint. J. Optim. Theory Appl. 169, 671–691 (2016)
Prasad, A., Sethi, S.P.: Competitive advertising under uncertainty: a stochastic differential game approach. J. Optim. Theory Appl. 123, 163–185 (2004)
Chen, L., Dong, T., Peng, J., Ralescu, D.: Uncertainty analysis and optimization modeling with application to supply chain management: a systematic review. Mathematics 11(11), 2530 (2023)
Bayat, S., Li, Y., Song, L., Han, Z.: Matching theory: applications in wireless communications. IEEE Signal Process. Mag. 33(6), 103–122 (2016)
Beiglbock, M., Juillet, N.: On a problem of optimal transport under marginal martingale constraints. Ann. Probab. 44(1), 42–106 (2016)
Beiglböck, M., Lim, T., Obłój, J.: Dual attainment for the martingale transport problem. Bernoulli 25(3), 1640–1658 (2019)
Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust Optimization. Princeton University Press, New Jersey (2009)
Bertsimas, D., Brown, D.B., Caramanis, C.: Theory and applications of robust optimization. SIAM Rev. 53(3), 464–501 (2011)
Billingsley, P.: Convergence of Probability Measures. John Wiley & Sons, New Jersey (2013)
Boyd, S., Boyd, S.P., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)
Brückerhoff, M., Juillet, N.: Instability of martingale optimal transport in dimension \(d\ge 2\). Electron. Commun. Probab. 27, 1–10 (2022)
Carlier, G., Ekeland, I.: Matching for teams. Econ. Theor. 42(2), 397–418 (2010)
Carlier, G., Jimenez, C., Santambrogio, F.: Optimal transportation with traffic congestion and wardrop equilibria. SIAM J. Control. Optim. 47(3), 1330–1350 (2008)
Chiappori, P.: Matching with Transfers: The Economics of Love and Marriage. Princeton University Press, New Jersey (2017)
Chiappori, P., McCann, R.J., Nesheim, L.P.: Hedonic price equilibria, stable matching, and optimal transport: equivalence, topology, and uniqueness. Econ. Theor. 42(2), 317–354 (2010)
Chiappori, P., McCann, R.J., Pass, B.: Multi-to one-dimensional optimal transport. Commun. Pure Appl. Math. 70(12), 2405–2444 (2017)
Chiappori, P.A., McCann, R., Pass, B.: Multidimensional matching. arXiv preprint (2016) arXiv:1604.05771
Ekeland, I.: An optimal matching problem. ESAIM Control Optim. Calc. Var. 11(1), 57–71 (2005)
Fan, K.: Minimax theorems. Proc. Natl. Acad. Sci. U.S.A. 39(1), 42 (1953)
Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 69(1), 9–15 (1962)
Galichon, A., Henry-Labordere, P., Touzi, N.: A stochastic control approach to no-arbitrage bounds given marginals, with an application to lookback options. Ann. Appl. Probab. 24(1), 312–336 (2014)
Gonczarowski, Y.A., Friedgut, E.: Sisterhood in the Gale-Shapley matching algorithm. Electron. J. Comb. 20(2), P12 (2013)
Gretsky, N.E., Ostroy, J.M., Zame, W.R.: The nonatomic assignment model. Econ. Theor. 2(1), 103–127 (1992)
Gupta, S., Iwama, K., Miyazaki, S.: Stable Nash equilibria in the Gale-Shapley matching game. (2015) arXiv preprint arXiv:1509.04344
Henry-Labordère, P.: Model-Free Hedging: A Martingale Optimal Transport Viewpoint. CRC Press, Boca Raton (2017)
Kantorovich, L.V.: On a problem of Monge. J. Math. Sci. 133(4), 1383–1383 (2006)
Korman, J., McCann, R.J.: Optimal transportation with capacity constraints. Trans. Am. Math. Soc. 367(3), 1501–1521 (2015)
Monge, G.: Memory on the theory of excavations and embankments. History of the Royal Academy of Sciences of Paris (1781)
Pass, B.: Multi-marginal optimal transport and multi-agent matching problems: uniqueness and structure of solutions. (2012) arXiv preprint arXiv:1210.7372
Piccoli, B., Rossi, F., Trélat, E.: Control to flocking of the kinetic Cucker-Smale model. SIAM J. Math. Anal. 47(6), 4685–4719 (2015)
Shapley, L.S., Shubik, M.: The assignment game I: The core. Internat. J. Game Theory 1(1), 111–130 (1971)
Sørensen, M.: How smart is smart money? A two-sided matching model of venture capital. J. Financ. 62(6), 2725–2762 (2007)
Strassen, V.: The existence of probability measures with given marginals. Ann. Math. Stat. 36(2), 423–439 (1965)
Villani, C.: Topics in Optimal Transportation, vol 58. American Mathematical Soc., (2003)
Villani, C.: Optimal Transport: Old and New, vol 338. Springer Science & Business Media (2008)
Zaev, D.A.: On the Monge-Kantorovich problem with additional linear constraints. Math. Notes 98(5–6), 725–741 (2015)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Jean-Pierre Crouzeix.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix
Appendix
This section contains the proof of the results stated above.
Proof
(Proposition 2.1) Since, for every \(\omega _i\in {\mathcal {W}}_i\) where \(i\in \{0,\dots ,N\}\), the support of the matching between the set of types \(X_i\) distributed according to \(\mu _i\in {\mathcal {P}}(X_i)\) and the set of optimal goods in Z distributed according to \(\nu \in {\mathcal {P}}(Z)\) satisfies (13), following from [38, Chapter 2], we have that, for every \(\omega _i\in {\mathcal {W}}_i\), where \(i\in \{0,1,\dots ,N\}\), \(\gamma _i\) solves
where
From (3), since we require the optimizer to be independent of \(\omega _i\in {\mathcal {W}}_i\), where \(i\in \{0,\dots ,N\}\), following for instance from [11, Chapter 2], the matching \(\gamma _i\) corresponding to problem (7) solves
Suppose that there exists \({\tilde{\omega }}_i\in {\mathcal {W}}_i\) such that
Since \(\omega _i=t{\tilde{\omega }}_i\in {\mathcal {W}}_i\), where \(t\in {\mathbb {R}}\), by considering \(t\rightarrow \infty \) we obtain
Hence, to guarantee that (39) is finite, we must require that \(\langle \gamma _i,{{\mathcal {W}}_i}\rangle =0\) defined in (16) holds. Therefore,
where
\(\square \)
Proof
(Proposition 2.2) Suppose that the set \(\{(\psi _i,\gamma _i,\nu )\}_{i=0}^N\) is an RME. Then, from Definition 2.2, we have that
for some \(\omega ^*_i\in {\mathcal {W}}_i\). Since \(\langle \gamma _i,{\mathcal {W}}_i\rangle =0\), we have that \(\nu \in {\mathcal {M}}_{{\mathcal {W}}}(\mu )\). Therefore, by (9)-(10), for any other probability measure \(\rho \in {\mathcal {M}}_{{\mathcal {W}}}(\mu )\), we have that
Therefore, \(\nu \in {\mathcal {M}}_{{\mathcal {W}}}(\mu )\) solves the primal problem (26).
Note that, for any other functions \((\varphi _0,\dots ,\varphi _N)\subset C(Z;{\mathbb {R}})\) such that
holds, where \(z\in Z\), we have that
Therefore, \((\psi _0,\dots ,\psi _N)\) and \((\omega ^*_0,\dots ,\omega ^*_N)\), with \(\omega ^*_i\in {\mathcal {W}}_i\), solve the dual problem in (27). \(\square \)
The following result will be useful.
Theorem 3.1
[23, Theorem 1] Let K be a compact Hausdorff space, W an arbitrary vector space and \(h:K\times W \rightarrow {\mathbb {R}}\) be lower semicontinuous in x, where \(x\in K\), for each fixed \(y\in W\), convex on K and concave on W. Then
For the purpose of the following proof, we will denote the uniform norm by \(\Vert \cdot \Vert _{\infty , X_i}\) to emphasize that the domain of the space of continuous functions of interest is \(X_i\) and \(\Vert \cdot \Vert \) the usual absolute value in \({\mathbb {R}}\).
Proof
(Proposition 2.3) Let \(\omega _i\in {\mathcal {W}}_i\). Then, for \(\psi _{i1},\psi _{i2}\in C(Z;{\mathbb {R}})\), we have that
where, in the second equality, we have used the definition of \(\psi _i^{(c_i+\omega _i)}\) in (9) and in the third inequality, we have used the fact that \(\Vert \sup f-\sup g\Vert \le \sup \Vert f-g\Vert \), for bounded real-valued functions f and g. Also, using a similar argument, for any \(\omega _{i1},\omega _{i2}\in {\mathcal {W}}_i\), we have that
This shows that \({\mathcal {F}}_i(\cdot ,\cdot )\) is continuous on \(C(Z;{\mathbb {R}})\times {\mathcal {W}}_i\). To show for concavity of \({\mathcal {F}}_i(\cdot ,\omega _i)\), we observe that for \(\lambda \in (0,1)\) and \(\psi _{i1},\psi _{i2}\in C(Z;{\mathbb {R}})\),
and hence, by integrating both sides, we obtain
Similarly, one can show that, for \(\omega _{i1},\omega _{i2}\in {\mathcal {W}}_i\),
which proves that the functional \({\mathcal {F}}_i(\psi _i,\cdot )\) is concave in \(\omega _i\), for \(\psi _i\in C(Z;{\mathbb {R}})\). This concludes that \(h_i\) defined in (29) is a continuous convex functional on \(C(Z;{\mathbb {R}})\).
We show that the Fenchel conjugate of \(h_i\) is
where \(\nu \in {\mathcal {M}}_{{\mathcal {W}}}(\mu )\).
Let \(h_i^*(\nu )<\infty \). If \(\nu \notin {\mathscr {M}}_+(Z)\), then there exists \({\tilde{\psi }}_i\le 0\) such that
Let \(\omega _i\in {\mathcal {W}}_i\) and \(t\ge 0\). Since \((t{\tilde{\psi }}_i)^{(c_i+\omega _i)}(x_i)\ge \min _{(x_i,z)\in X_i\times Z} (c_i(x_i,z)+\omega _i(x_i,z))\), we have
Furthermore, if \(\nu \notin {\mathcal {P}}(Z)\), then
We proceed to show that (40) holds. If \(\nu \in {\mathcal {M}}_{{\mathcal {W}}}(\mu )\), then \(\textrm{K}_{c_i,{\mathcal {W}}_i}(\mu _i,\nu )<\infty \) and
Let \(h_{c_i}(\gamma _i,\omega _i):= \int _{X_i\times Z} (c_i(x_i,z)+\omega _i(x_i,z)) d\gamma _i\), where \((\gamma _i,\omega _i)\in \varPi (\mu _i,\nu )\times {\mathcal {W}}_i\). From [38, Chapter 1, Page 32], since \(\varPi (\mu _i,\nu )\) is a compact, \(h_{c_i}(\cdot ,\omega _i)\) is convex function on \( \varPi (\mu _i,\nu )\) and \(h_{c_i}(\gamma _i,\cdot )\) is affine functional on \({\mathcal {W}}_i\), from Theorem 3.1 and (24), we have
Therefore, we conclude that
whenever \(\nu \in {\mathcal {M}}_{{\mathcal {W}}}(\mu )\). \(\square \)
Proof
(Proposition 2.4) Consider the map \((h_1\square h_2):C(Z,{\mathbb {R}}) \rightarrow {\mathbb {R}}\) defined as
Since \(h_i\) in (29) is a convex functional on \(C(Z,{\mathbb {R}})\), we conclude that
is a convex functional on \(C(Z,{\mathbb {R}})\). Furthermore, one can check that the Fenchel conjugate of \((h_1\square h_2)\) is \((h_1\square h_2)^*(\nu )= h_1^*(\nu )+h_2^*(\nu )<\infty \), where \(\nu \in {\mathcal {M}}_{{\mathcal {W}}}(\mu )\). Therefore, we conclude that \({\mathcal {L}}\) is a convex functional on \(C(Z,{\mathbb {R}})\) and
where \(\nu \in {\mathcal {M}}_{{\mathcal {W}}}(\mu )\). \(\square \)
Proof
(Proposition 2.5) From Proposition 2.4, since \({\mathcal {L}}\) is a convex functional over \(C(Z;{\mathbb {R}})\), we have that \({\mathcal {L}}^{**}={\mathcal {L}}\) (see [14, Page 94]), where \({\mathcal {L}}^{**}\) is the Fenchel conjugate of \({\mathcal {L}}^{*}\). Since \({\mathcal {M}}_{{\mathcal {W}}}(\mu )\subset {\mathcal {P}}(Z)\) is a non-empty weakly compact set (as it is a closed subset of a weakly compact set \({\mathcal {P}}(Z)\)), from (32), we have that
By setting \(\psi \equiv 0\) and using Proposition 2.6, we have
Since
where \({\mathscr {T}}\) is defined in (28), we have
Now, since \(-{\mathcal {L}}^{**}(0)=-{\mathcal {L}}(0)\), we obtain that
\(\square \)
Proof
(Proposition 2.5) From Proposition 2.4, since \({\mathcal {L}}\) is a convex functional over \(C(Z;{\mathbb {R}})\), we have that \({\mathcal {L}}^{**}={\mathcal {L}}\) (see [14, Page 94]), where \({\mathcal {L}}^{**}\) is the Fenchel conjugate of \({\mathcal {L}}^{*}\). Since \({\mathcal {M}}_{{\mathcal {W}}}(\mu )\subset {\mathcal {P}}(Z)\) is a non-empty weakly compact set (as it is a closed subset of a weakly compact set \({\mathcal {P}}(Z)\)), from (32), we have that
By setting \(\psi \equiv 0\) and using Proposition 2.6, we have
Since
where \({\mathscr {T}}\) is defined in (28), we have
Since \(-{\mathcal {L}}^{**}(0)=-{\mathcal {L}}(0)\), we obtain
\(\square \)
Proof
(Proposition 2.6) Statement (i) implies that \(\nu \) satisfies Definition 2.2, part 2, and Statement (ii) implies that the functions \((\psi _0,\dots ,\psi _N)\) satisfies Definition 2.2, part 1. Therefore, we are only left to show Definition 2.2, part 3.
Since \(\nu \in {\mathcal {M}}_{{\mathcal {W}}}(\mu )\) solves problem \(\textrm{P}\) and \((\psi _0,\dots ,\psi _N)\) and \((\omega ^*_0,\dots ,\omega ^*_N)\) solve problem \(\textrm{P}^*\), using Proposition 2.5, we have that
where
and \(\gamma _i\in \varPi _{{\mathcal {W}}_i}(\mu _i,\nu )\) satisfies
Therefore,
where \((x_i,z)\in X_i\times Z\), we have that
\(\square \)
Proof
(Theorem 2.2) Let \(\omega _i^*\in {\mathcal {W}}_i\) be a maximizer for the R.H.S. of (29) and consider a minimizing sequence \(\{\big (\psi _{0,n},\dots ,\psi _{N,n}\big )\}_{n\ge 1} \subset {\mathscr {T}}\). Let
where \(\psi _{i,n}^{(c_i+\omega ^*_i)\overline{(c_i+\omega ^*_i)}}\) is defined in (25) and consider
Then, \(\{(\alpha _{0,n},\dots ,\alpha _{N,n})\}_{n\ge 1} \subset {\mathscr {T}}\). Furthermore, for \(i\in \{1,\dots ,N\}\), we have \(\alpha _{i,n}\in (c_i+\omega ^*_i)-\textrm{conc}(Z;{\mathbb {R}})\), for all \(n\ge 1\) and
Also, from (42) and (43) and since
for \(i\in \{1,\dots ,N\}\), we have that
where \(n\ge 1\). Therefore, \(\{(\alpha _{0,n},\dots ,\alpha _{N,n})\}_{n\ge 1}\subset {\mathscr {T}}\) is an improved minimizing sequence. Since \(c_i+\omega _i^*\in C(X_i\times Z;{\mathbb {R}})\), we have that the i-th sequence admits a minimizing subsequence \(\{\alpha _{i,n}\}_{n\ge 1}\) that converges uniformly to the minimizer \(\alpha _i\in (c_i+\omega ^*_i)-\textrm{conc}(Z;{\mathbb {R}})\). Therefore,
\(\square \)
Rights and permissions
About this article
Cite this article
Adu, D.O., Gharesifard, B. Robust Matching for Teams. J Optim Theory Appl 200, 501–523 (2024). https://doi.org/10.1007/s10957-023-02349-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-023-02349-3