2020/09/27

Greedy.

One intuitive solution for the matching market at vesti dana challenges is the Greedy algorithm. The Greedy algorithm attempts to match each agent immediately after arrival. Depending on the market context, it might select one of the connections (edges), if these exist at the moment of entry, to maximize the cardinality matching, uniformly at random, or with the best utility. The algorithm handles each node as a stationary matching task and neglects the future. For the market with his mechanism provides a stable matching - there exists no such pair that would preferably be matched with some other agent in place of the current partner.