We investigate the parameterized complexity of finding diverse sets of solutions to three fundamental combinatorial problems. The input to the Weighted Diverse Bases problem consists of a matroid $$M$$ , a weight function $$\omega :E(M)\rightarrow \mathbb {N} $$ , and integers $$k\ge 1, d\ge 1$$ . The task is to decide if there is a collection of $$k$$ bases $$B_{1}, \dotsc , B_{k}$$ of $$M$$ such that the weight of the symmetric difference of any pair of these bases is at least $$d$$ . The input to the Weighted Diverse Common Independent Sets problem consists of two matroids $$M_{1},M_{2}$$ defined on the same ground set $$E$$ , a weight function $$\omega :E\rightarrow \mathbb {N} $$ , and integers $$k\ge 1, d\ge 1$$ . The task is to decide if there is a collection of $$k$$ common independent sets $$I_{1}, \dotsc , I_{k}$$ of $$M_{1}$$ and $$M_{2}$$ such that the weight of the symmetric difference of any pair of these sets is at least $$d$$ . The input to the Diverse Perfect Matchings problem consists of a graph $$G$$ and integers $$k\ge 1, d\ge 1$$ . The task is to decide if $$G$$ contains $$k$$ perfect matchings $$M_{1},\dotsc ,M_{k}$$ such that the symmetric difference of any two of these matchings is at least $$d$$ . We show that none of these problems can be solved in polynomial time unless $${{\,\mathrm{\textsf{P}}\,}} ={{\,\mathrm{\textsf{NP}}\,}} $$ . We derive fixed-parameter tractable ( $${{\,\mathrm{\textsf{FPT}}\,}}$$ ) algorithms for all three problems with $$(k,d)$$ as the parameter, and present a $$poly(k,d)$$ -sized kernel for Weighted Diverse Bases.