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
+2-11Lines changed: 2 additions & 11 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -57,13 +57,11 @@ Given a *cost function* $c:X \times Y \rightarrow \mathbb{R}$, the (discrete) *o
57
57
58
58
59
59
$$
60
-
\begin{equation}
61
60
\begin{aligned}
62
61
\min_{\mu \geq 0}& \sum_{(x,y) \in X \times Y} \mu_{xy}c_{xy}\\
63
62
\text{s.t. }& \sum_{x \in X} \mu_{xy} = n_x \\
64
63
& \sum_{y \in Y} \mu_{xy} = m_y
65
64
\end{aligned}
66
-
\end{equation}
67
65
$$
68
66
69
67
Given our discreteness assumptions about $n$ and $m$, the problem admits an integer solution $\mu \in \mathbb{Z}_+^{X \times Y}$, i.e. $\mu_{xy}$ is a non-negative integer for each $x\in X, y\in Y$.
@@ -101,13 +99,11 @@ In the following implementation we assume that the cost function is $c_{xy} = |x
The following class takes as inputs sets of types $X,Y \subset \mathbb{R},$ marginals $n, m $ with positive integer entries such that $\sum_{x \in X} n_x = \sum_{y \in Y} m_y $ and cost parameter $\zeta>1$.
@@ -1584,21 +1578,18 @@ Since the dual is feasible and bounded, $V_P = V_D$ (*strong duality* prevails)
1584
1578
Assume now that $y_{xy} = \alpha_x + \gamma_y - c_{xy}$ is the output generated by matching $x$ and $y.$ It includes the sum of $x$ and $y$ specific amenities/outputs minus the cost $c_{xy}.$ Then, we have can formulate the following problem and its dual
0 commit comments