We study strategies with one–period recall in the context of a general class of multilateral bargaining games. A strategy has one–period recall if actions in a particular period are only conditioned on information in the previous and the current period. We show that if players are...

This research states the stylised n (more than two) players' splitting problem as a mathematical programme, relying on definitions of the values of the game and problem stationarity to generate tractable reduced forms, and derives the known solutions according to the properties of pertaining...