AbstractWe consider a randomized version of the greedy algorithm for finding a large matching in a graph. We assume that the next edge is always randomly chosen from those remaining. We analyze the performance of this algorithm when the input graph is fixed. We show that there are graphs for which this Randomized Greedy Algorithm(RGA)usually only obtains a matching close in size to that guaranteed by worst‐case analysis (i.e., half the size of the maximum). For some classes of sparse graphs (e.g., planar graphs and forests) we show that theRGAperforms significantly better than the worst‐case. Our main theorem concerns forests. We prove that the ratio to maximum here is at least 0.7690…, and that this bound is