The Norm Game introduced by Axelrod is investigated by computer simulations carried out for agents distributed in a random network. The agents are labeled as sinners or punishers after their first decision. The stationary state shows a bistable behaviour: all become sinners or all become punishers [1,2]. Here we show how this bistability changes when some amount of agents always break the norm or always punish.