The resource auction mechanism can maximize the resource allocation benefit by fully introducing competition, and has found widespread applications in mobile edge computing resource allocation and pricing. Currently, auction mechanisms relevant to resource allocation of mobile edge computing mainly focus on computing resource allocation of edge servers, and there are limitations in both considering the allocation of wireless bandwidth resources that do not belong to any edge servers and computing resources belonging to specific edge servers under a multi-base station environment. Furthermore, with multiple types of resource conditions considered, a challenge is posed to the design of a resource allocation and pricing strategy that guarantees benefits for both resource providers and users. By analyzing the characteristics of multi-base stations and resource constraints, this study proposes a double-auction-based combinational resource allocation (DACRA) mechanism for mobile edge computing. This mechanism considers the allocation of wireless bandwidth resources in multi-communication base stations and multiple computing resources of edge servers and introduces resource scarcity and bidding density to ensure high allocation efficiency. Theoretical analysis shows that the DACRA mechanism is a polynomial time algorithm that satisfies incentive compatibility, budget-balance, and individual rationality. Simulation results based on a publicly available dataset show that the proposed mechanism can yield lower computational time costs, and higher social welfare, request success rates, and resource utilization rates than existing research results.