Auction Algorithm

From Optimal Transport Wiki
Revision as of 20:02, 14 May 2020 by Andrewgracyk (talk | contribs)
Jump to navigation Jump to search

The auction algorithm[1] is an algorithm in optimal transport in which a set of buyers exchange goods for varied prices until an eventual equilibrium is reached. The algorithm pertains to the discrete formulation of optimal transport, as well as provides a connection to the dual problem. The algorithm is useful in the field of economics because of its ability to find an equilibrium.


References

Cite error: <ref> tag with name "Santambrogio" defined in <references> is not used in prior text.