Talk:Auction Algorithm: Difference between revisions
Jump to navigation
Jump to search
(Discussion Auction Algorithm) |
No edit summary |
||
| Line 1: | Line 1: | ||
==The Assignment Problem== | |||
* What is meant by ``when weights ai and bj are equal``? ai and bj have not yet been defined. | |||
* More explanation as to why this equilibrium condition corresponds to the buyers being ``happy`` would be useful. | |||
* It would be nice to elaborate more on the last two senteces -- what is meant by coupling? what is meant by optimal assignment? It may be useful to reference the OT wiki page on discrete optimal transport. | |||
Revision as of 17:15, 14 May 2020
The Assignment Problem
- What is meant by ``when weights ai and bj are equal``? ai and bj have not yet been defined.
- More explanation as to why this equilibrium condition corresponds to the buyers being ``happy`` would be useful.
- It would be nice to elaborate more on the last two senteces -- what is meant by coupling? what is meant by optimal assignment? It may be useful to reference the OT wiki page on discrete optimal transport.