We find how to compute the non-symmetric Nash bargaining solution by means of a generalized property of linear division of the joint surplus, as an alternative of solving the maximization of the generalized Nash product. This generalized property of linear division in the non-symmetric Nash...

We present a novel algorithm to determine the payoff-space of certain normal-form C1 parametric games, and - more generally - of continuous families of normal-form C1 games. The algorithm has been implemented by using MATLAB, and it has been applied to several examples. The implementation of the...

We generalize the equivalence of the non-symmetric Nash bargaining solution and the linear division of the joint surplus when bargainers use different utility scales. This equivalence in the general case requires the surplus each agent receives to be expressed in compatible, or comparable,...

Consider a two-person bargaining problem, where both agents have a particular notion of what would be a just solution outcome. In case their opinions differ, a procedure which leads to a compromise between t,he two different views is needed. In this paper we propose a mechanism to solve this...