Organizational Matching

Hideto Koizumi, Business Economics and Public Policy, The Wharton School

Abstract: For relatively large firms, especially multinationals, it is often a difficult human resource task to assign employees to different country offices, departments, divisions, or teams in the best possible way. This task can be extremely delicate and complex, especially when a company has many employees to go through the (re)assignment process. We came up with a matching algorithm to solve this complicated task in the best way; that is, no one can try to overturn the system and do better than what the algorithm does. We test our algorithm with an analogous situation of the NYC school choice system.