In this paper, we propose a new scheme for aggregating access points backhaul bandwidth resources in wireless local area networks. We consider a setting with several access points, some with excess backhaul capacity, and others in shortage of it, and propose a symmetric approach wherein the distribution of resources is managed between providing and beneficiary access points, without involving the direct participation of the users. We then model the proposal using one-to-one matching game theory and make use of the so-called deferred access (DA) algorithm to reach an optimal, stable solution for the problem. In comparison with random distribution of available backhaul resources, the DA scheme offers significantly better performance in terms of overall throughput, reaching up to 40% when compared to random matching