Manipulation in the division problem for two players

In the division problem for two players it is assumed that one of them is honest and informs his true preferences. The second player knows in advance the preferences of the first player and he tends to use this information in the maximum beneficial way for himself. In essence, this article is the recommendation for the second player. Here, it turns out that the optimal strategy does not practically depend on the division procedure (if the latter is sufficiently reasonable, i.e., if at the given preference of the partners there exist fair divisions, the procedure suggests one of them).