 More formally, suppose that two individuals are presented with a resource of size \(C\) by a third party. A strategy for a player, in this game, consists of an amount of cake that he would like. The set of possible strategies for a player is thus any amount between 0 and \(C\). If the sum of strategies for each player is less than or equal to \(C\), each player receives the amount he asked for. However, if the sum of strategies exceeds \(C\), no player receives anything. Figure 13 illustrates the feasible set for this game.