An antimatroid is a combinatorial structure abstracting the convexity in geometry. In this paper, we explore novel connections between antimatroids and matchings in a bipartite graph. In particular, we prove that a combinatorial structure induced by stable matchings or maximum-weight matchings is an antimatroid. Moreover, we demonstrate that every antimatroid admits such a representation by stable matchings and maximum-weight matchings. 查看全文>>