On iterated Nash bargaining solutions (Q6136266)

The Nash bargaining theory has become one of the most fruitful paradigms in game theory and has inspired a large literature on axiomatic solutions and applications. The paper contributes to this vast literature in three ways. First, to enhance applicability, the study introduce a family of domains of bargaining problems allowing for non-convexity. Second, using elementary methods, the complexity were characterized the explicit structures of the solutions and associated bargaining powers under the Nash axioms for each of the domains. The approach with elementary methods simplifies applications of the results. Third, due to the structural complexity, the recoverability of the bargaining powers for non-convex problems under the Nash axioms is not as transparent as for convex problems.