Kantorovich Problem: Difference between revisions
No edit summary |
No edit summary |
||
Line 1: | Line 1: | ||
==Introduction== | |||
The Kantrovich problem admits a dual because it is a linear minimization problem with convex constraints. | |||
==Shipping problem== | |||
Suppose there is a merchant who is attempting to ship their items from one place to another. They can hire trucks at some cost <math>c(x, y)</math> for each unit of merchandise which is shipped from point <math>x</math>to point <math>y</math>. Now the shipper is approached by a mathematician, who claims that prices can be set such that they align with the shipper's financial interests. This would be achieved by setting the price <math>\phi(x)</math> and <math>\phi(y)</math> such that the sum of <math>\phi(x)</math> and <math>\phi(y)</math> is always less than the cost <math>c(x, y)</math>. This may even involve setting negative prices in certain cases. However, it can be shown that the shipper will spend almost as much as they would have if they had opted for the original pricing method. | |||
==Kantrovich's Optimal Transport Problem== | |||
Given <math>\mu \in \mathcal{P}(X)</math> and <math>\nu \in \mathcal{P}(Y)</math> | |||
Minimize: | |||
<math> | |||
\mathbb{K}(\pi)=\int_{X \times Y} c(x, y) \mathrm{d} \pi(x, y) | |||
</math> | |||
over <math> \pi \in \Pi(\mu, \nu)</math> | |||
==Kantorovich Duality Statement== | |||
===Definition=== | |||
Kantorovich's Optimal Transport Problem: given <math>\mu \in \mathcal{P}(X)</math> and <math>\nu \in \mathcal{P}(Y)</math> | |||
Minimize: | |||
<math>\mathbb{K}(\pi)=\int_{X \times Y} c(x, y) \mathrm{d} \pi(x, y)</math> | |||
over <math>\pi \in \Pi(\mu, \nu)</math> | |||
===Theorem=== | |||
Let <math>\mu \in \mathcal{P}(X), \nu \in \mathcal{P}(Y)</math> where <math>X, Y</math> are Polish spaces. Let <math>c: X \times Y \rightarrow[0,+\infty]</math> be a lower semi-continuous cost function. | |||
Define <math>\mathbb{K}</math> as in the following: | |||
==Kantorovich's Optimal Transport Problem== | |||
given <math>\mu \in \mathcal{P}(X)</math> and <math>\nu \in \mathcal{P}(Y)</math> | |||
Minimize: | |||
<math> | |||
\mathbb{K}(\pi)=\int_{X \times Y} c(x, y) \mathrm{d} \pi(x, y) | |||
</math> | |||
over <math>\pi \in \Pi(\mu, \nu)</math> | |||
and <math>\mathbb{J}</math> by | |||
(need reference 3.1) <math>\quad \mathbb{J}: L^{1}(\mu) \times L^{1}(\nu) \rightarrow \mathbb{R}, \quad \mathbb{J}(\varphi, \psi)=\int_{X} \varphi \mathrm{d} \mu+\int_{Y} \psi \mathrm{d} \nu </math> | |||
Let <math>\Phi_{c}</math> be defined by | |||
<math> | |||
\Phi_{c}=\left\{(\varphi, \psi) \in L^{1}(\mu) \times L^{1}(\nu): \varphi(x)+\psi(y) \leq c(x, y)\right\} | |||
</math> | |||
where the inequality is understood to hold for <math>\mu$</math> -almost every <math>x \in X</math> and <math>\nu</math> -almost every <math>y \in Y</math>. | |||
Then, | |||
<math> | |||
\min _{\pi \in \Pi(\mu, \nu)} \mathbb{K}(\pi)=\sup _{(\varphi, \psi) \in \Phi_{c}} \mathbb{J}(\varphi, \psi) | |||
</math> | |||
===References:=== | |||
An article on Kantorovich problem | An article on Kantorovich problem | ||
References Villani (1-3, 6-9), Santambrogio (xv-xvii,1-9) | References Villani (1-3, 6-9), Santambrogio (xv-xvii,1-9) |
Revision as of 04:08, 9 May 2020
Introduction
The Kantrovich problem admits a dual because it is a linear minimization problem with convex constraints.
Shipping problem
Suppose there is a merchant who is attempting to ship their items from one place to another. They can hire trucks at some cost Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle c(x, y)} for each unit of merchandise which is shipped from point to point . Now the shipper is approached by a mathematician, who claims that prices can be set such that they align with the shipper's financial interests. This would be achieved by setting the price and Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \phi(y)} such that the sum of and is always less than the cost . This may even involve setting negative prices in certain cases. However, it can be shown that the shipper will spend almost as much as they would have if they had opted for the original pricing method.
Kantrovich's Optimal Transport Problem
Given and
Minimize:
Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \mathbb{K}(\pi)=\int_{X \times Y} c(x, y) \mathrm{d} \pi(x, y) } over
Kantorovich Duality Statement
Definition
Kantorovich's Optimal Transport Problem: given Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \mu \in \mathcal{P}(X)} and
Minimize:
Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \mathbb{K}(\pi)=\int_{X \times Y} c(x, y) \mathrm{d} \pi(x, y)}
over
Theorem
Let Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \mu \in \mathcal{P}(X), \nu \in \mathcal{P}(Y)} where Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle X, Y} are Polish spaces. Let be a lower semi-continuous cost function.
Define Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \mathbb{K}} as in the following:
Kantorovich's Optimal Transport Problem
given and Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \nu \in \mathcal{P}(Y)}
Minimize:
over
and by (need reference 3.1) Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \quad \mathbb{J}: L^{1}(\mu) \times L^{1}(\nu) \rightarrow \mathbb{R}, \quad \mathbb{J}(\varphi, \psi)=\int_{X} \varphi \mathrm{d} \mu+\int_{Y} \psi \mathrm{d} \nu }
Let be defined by where the inequality is understood to hold for Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \mu$} -almost every Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle x \in X} and -almost every .
Then, Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \min _{\pi \in \Pi(\mu, \nu)} \mathbb{K}(\pi)=\sup _{(\varphi, \psi) \in \Phi_{c}} \mathbb{J}(\varphi, \psi) }
References:
An article on Kantorovich problem References Villani (1-3, 6-9), Santambrogio (xv-xvii,1-9)
Kantorovich Problem
Advantages of Kantorovich Problem
References
</ references>
- ↑ C. Villani, Topics in Optimal Transportation, Chapter 1.
- ↑ https://link-springer-com.proxy.library.ucsb.edu:9443/book/10.1007/978-3-319-20828-2 F. Santambrogio, Optimal Transport for Applied Mathematicians, Chapter 1.]