Abraham et al. [1]} describes the process of a sequence of promotions for houses in the ha problem in order to return a trade-in-free matching. A similar process is described here to remove all blocking pairs of type (3bi). We create the following data structures.
