We study a Medium Access game modeled as a splittable atomic routing game in a parallel link topology. Each player has to decide how to split her traffic among the links. We take the expected loss probability of a player as her cost and consider various loss scenarios: 1) the M/M/1/1 queue in which an arrival that finds another packet in service is lost, 2) Losses occur as in 1, except that if arrival occurs when another packet is served, then both are lost. We furthermore assume that the packet in service is aborted if there was a collision. 3) Like 2, but the packet in service is not aborted. We study the existence and uniqueness of equilibrium under these three types of losses.