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...

This note suggests variations to the baseline Nash cooperative solution that take into account the Kalai-Smorodinsky critique. One the one hand, a CES form of the maximand is proven to accommodate both the generalized two-person Nash and the Kalai-Smorodinsky - as other proportional - solutions...