Auction Algorithm: Difference between revisions
Jump to navigation
Jump to search
Andrewgracyk (talk | contribs) No edit summary |
Andrewgracyk (talk | contribs) No edit summary |
||
| Line 1: | Line 1: | ||
The auction algorithm<ref name="Peyré and Cuturi" /> 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. | The auction algorithm<ref name="Peyré and Cuturi" /> 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. The algorithm was invented by Bertsekas, but it was eventually updated. | ||
Revision as of 20:04, 14 May 2020
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. The algorithm was invented by Bertsekas, but it was eventually updated.
References
Cite error: <ref> tag with name "Santambrogio" defined in <references> is not used in prior text.