2 ms·
The stable matching problem and the secretary problem are not the same thing. The stable matching problem is operates at a high level and is simply about match
by lliamander 8y ago
The stable matching problem and the secretary problem are not the same thing. The stable matching problem is operates at a high level and is simply about matching pairs based on known preferences of multiple agents.
The secretary problem is about a single agent attempting to make a selection based off of incomplete information, and does involve an exploration phase.