You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: lectures/match_transport.md
+10-10Lines changed: 10 additions & 10 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -15,19 +15,19 @@ kernelspec:
15
15
16
16
## Overview
17
17
18
-
Optimal transport theory studies how a marginal probabilty measure can be related to another marginal probability measure in an ideal way.
18
+
Optimal transport theory studies how a marginal probability measure can be related to another marginal probability measure in an ideal way.
19
19
20
20
* here ideal means to minimize some cost criterion.
21
21
22
-
The output of such a theory is a **coupling** of the two probability measures, i.e., a joint probabilty
22
+
The output of such a theory is a **coupling** of the two probability measures, i.e., a joint probability
23
23
measure having those two marginal probability measures.
24
24
25
-
This lecture describes how Job Boerma, Aleh Tsyvinski, Ruodo Wang,
25
+
This lecture describes how Job Boerma, Aleh Tsyvinski, Ruodu Wang,
26
26
and Zhenyuan Zhang {cite}`boerma2023composite` used optimal transport theory to formulate and compute an equilibrium of a model in which wages and allocations of workers across jobs adjust to match measures of different types with measures of different types of occupations.
27
27
28
28
Production technologies allow firms to reshape costs of mismatch so that they become concave.
29
29
30
-
It is then possible that in equilibrium there is neither **positive assortive** nor **negative assorting** matching, an outcome that {cite}`boerma2023composite` call **composite assortive** matching.
30
+
It is then possible that in equilibrium there is neither **positive assortative** nor **negative assortative** matching, an outcome that {cite}`boerma2023composite` call **composite assortative** matching.
31
31
32
32
For example, with composite matching in an equilibrium model with workers of different types, ex ante identical *workers* can sort into different *occupations*, some positively and some negatively.
33
33
@@ -665,7 +665,7 @@ def find_layers(self):
665
665
(H_z[None, 1:] <= layers_height[:-1, None])
666
666
* (layers_height[1:, None] <= H_z[None, :-1]))
667
667
668
-
# each layer is reshaped as a list of indices correponding to types
668
+
# each layer is reshaped as a list of indices corresponding to types
669
669
layers = [self.type_z[layers_01[ell]]
670
670
for ell in range(len(layers_height)-1)]
671
671
@@ -1194,7 +1194,7 @@ We then return the full matching, the off-diagonal matching, and the off-diagona
1194
1194
1195
1195
```{code-cell} ipython3
1196
1196
def solve_primal_pb(self):
1197
-
# Compute on-diagonal matching, create new instance with resitual types
1197
+
# Compute on-diagonal matching, create new instance with residual types
@@ -1440,7 +1440,7 @@ There are two feasible matchings, one corresponding to PAM, the other to NAM.
1440
1440
1441
1441
Evidently,
1442
1442
1443
-
* PAM corresponds to the matching with two medium side displacement because the correponding cost is strictly convex and increasing in the the displacement.
1443
+
* PAM corresponds to the matching with two medium side displacement because the correponding cost is strictly convex and increasing in the displacement.
1444
1444
1445
1445
* NAM corresponds to the matching with a small displacement and a large displacement because the gain is strictly convex and increasing in the displacement.
1446
1446
@@ -1485,7 +1485,7 @@ To explore the coincidental resemblence to a NAM outcome, let's shift left typ
1485
1485
1486
1486
PAM and NAM are invariant to any such shift.
1487
1487
1488
-
However, for a large enough shift, composite sorting now coindices with PAM.
1488
+
However, for a large enough shift, composite sorting now coincides with PAM.
1489
1489
1490
1490
```{code-cell} ipython3
1491
1491
N = 2
@@ -2138,7 +2138,7 @@ if len(exam_assign_OD.n_x) * len(exam_assign_OD.m_y) < 1000:
2138
2138
2139
2139
+++ {"user_expressions": []}
2140
2140
2141
-
Having computed the dual variables of the off-diagonal types, we compute the dual variables for perfecly matched pairs by setting
2141
+
Having computed the dual variables of the off-diagonal types, we compute the dual variables for perfectly matched pairs by setting
We plot the hystograms and the measure of underqualification for the worker types and job types. We then compute the primal solution and plot the matching.
2405
+
We plot the histograms and the measure of underqualification for the worker types and job types. We then compute the primal solution and plot the matching.
0 commit comments