Talk:Auction Algorithm: Difference between revisions

From Optimal Transport Wiki
Jump to navigation Jump to search
No edit summary
No edit summary
 
(One intermediate revision by the same user not shown)
Line 1: Line 1:
==The Assignment Problem==
==The Assignment Problem==
* What is meant by ``when weights ai and bj are equal``? ai and bj have not yet been defined.
* Consider removing the function phi(x), since you replace it by p
* 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.
==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
Retrieved from "http://www.otwiki.xyz/index.php?title=Talk:Auction_Algorithm&oldid=487"