A multiplayer reach-avoid game is a differential game between an attacking team with N-A attackers and a defending team with N-D defenders playing on a compact domain with obstacles. The attacking team aims to send M of the NA attackers to some target location, while the defending team aims to prevent that by capturing attackers or indefinitely delaying attackers from reaching the target. Although the analysis of this game plays an important role in many applications, the optimal solution to this game is computationally intractable when N-A > 1 or N-D > 1. In this technical note, we present two approaches for the N-A = N-D = 1 case to determine pairwise outcomes, and a graph theoretic maximum matching approach to merge these pairwise outcomes for an N-A, N-D > 1 solution that provides guarantees on the performance of the defending team. We will show that the four-dimensional Hamilton-Jacobi-Isaacs approach allows for real-time updates to the maximum matching, and that the two-dimensional "path defense" approach is considerably more scalable with the number of players while maintaining defender performance guarantees.