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