Auction Algorithm: Difference between revisions
Andrewgracyk (talk | contribs) No edit summary |
Andrewgracyk (talk | contribs) No edit summary |
||
| Line 4: | Line 4: | ||
== The Assignment Problem == | == The Assignment Problem == | ||
It is necessary to introduce the assignment problem because it applies a context in which we may apply our algorithm to find such an optimal equilibrium. Suppose we have both <math N < | It is necessary to introduce the assignment problem because it applies a context in which we may apply our algorithm to find such an optimal equilibrium. Suppose we have both <math> N </math> buyers as well as <math> N </math> goods. | ||
Revision as of 20:18, 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. It is an iterative approach. 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.
The Assignment Problem
It is necessary to introduce the assignment problem because it applies a context in which we may apply our algorithm to find such an optimal equilibrium. Suppose we have both buyers as well as goods.
References
Cite error: <ref> tag with name "Santambrogio" defined in <references> is not used in prior text.