Sangram Kadam and co-author Maciej H. Kotowski examine a dynamic, two‐sided, one‐to‐one matching market where agents on both sides interact over a period of time. The authors define and identify sufficient conditions for the existence of a dynamically stable matching, which may require revisions to initial assignments. A generalization of the deferred acceptance algorithm can identify dynamically stable outcomes in a large class of economies, including cases with intertemporal preference complementarities. They relate their analysis to market unraveling and to common market design applications, including the medical residency match.
Merger Enforcement Guidelines Review: Comments on algorithms for merger review
CRA’s Dr. Alex Arsenault recently submitted comments to the Canadian Competition Bureau’s review of Merger Enforcement Guidelines (MEGs). Dr. Arsenault’s...