In the present paper, a general multiobjective optimization problem is stated as a Nashgame. In the nonrestrictive case of two objectives, we address the problem of thesplitting of the design variable between the two players. The so-called territorysplitting problem is solved by means of an allocative approach. We propose two algorithmsin order to find fair allocation tables