We define matroid search problems, in which a decision maker (DM) searches for a set of objects where the set of objects and the collection of admissible sets of objects form a matroid. The DM decides whether to inspect each object to learn its value at some cost or to stop searching. We...