Talk:Auction Algorithm: Difference between revisions
Jump to navigation
Jump to search
(Discussion Auction Algorithm) |
No edit summary |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
==The Assignment Problem== | |||
* Consider removing the function phi(x), since you replace it by p | |||
==General Comments== | |||
* Add a reference to each of the following sections to point readers to where they can learn more: ``the assignment problem``, ``the algorithm``, ``epsilon complementary slackness`` | |||
* Add a section explaining the relationship between this algorithm and optimal transport | |||
Latest revision as of 18:06, 19 May 2020
The Assignment Problem
- Consider removing the function phi(x), since you replace it by p
General Comments
- Add a reference to each of the following sections to point readers to where they can learn more: ``the assignment problem``, ``the algorithm``, ``epsilon complementary slackness``
- Add a section explaining the relationship between this algorithm and optimal transport