2017/05/16 by Yasushi Kawase, Kawase, Yasushi, Yutaro Yamaguchi +1
Computer Science · Economics, Econometrics and Finance · #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Game Theory and Voting Systems
paper · pdf · doi:10.48550/arxiv.1705.05510
openalex publication_date 2017/05/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01
We explore novel connections between antimatroids and matchings in bipartite graphs. 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.