Coloring games and algebraic problems on matroids

This thesis is basically devoted to matroids -- fundamental structure of combinatorial optimization -- though some of our results concern simplicial complexes, or Euclidean spaces. We study old and new problems for these structures, with combinatorial, algebraic, and topological flavor.
Comment: PhD thesis in computer science, Jagiellonian University, defended 24 Jan 2014 (updated references)