Begum’s research focuses on problems where two different sets of agents are matched to each other, and an unforeseen event occurs. Therefore, a different matching must be found. Matching men to women, assigning patients to hospitals, assigning students to schools are a few examples of these type of problems.
For example, assume you are managing a match-making website, where a number of men and women are looking to be matched with a stable partner. The rule of the website is that everyone has to rank all members of the opposite sex in decreasing order of their preference. As the manager, when everyone completes their rankings, you must assign everyone a stable partner, where everyone is happy with their assigned partners and no unmatched couples are likely to cheat on their assigned partners by being together. There already exist some methods to find this assignment. Begum and the team enhance this assignment by adding a ‘robustness’ feature to it. A robust solution found by their method guarantees that if any one of the couples wants to break-up, they can find other partners for them by breaking-up the minimum number of other relationships and still make everyone happy!