We study channel resolvability for the discrete memoryless multiple access channel with cribbing, i.e., the characterization of the amount of randomness required to approximate an i.i.d. output distribution in terms of ...