Consider two groups of agents, X and Y, each with the same number k of agents.
An allocation {A1, .., An} is called group-envy-free if there is no group of agents that envies another group with the same number of agents.