Some achievement and avoidance games on partitional matroids


Dragan M. Acketa




The paper solves (1-color-) achievement and avoidance (2-person-) games for bases, circuits and hyperplanes, of partitional matroids. The solution of achievement game for bases Is partial. Some solutions do hold for general matroids as well.