On iterated Nash bargaining solutions
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.
- An extension of the Nash bargaining solution to nonconvex problems
- Multiple-issue bargaining and axiomatic solutions
- Bargaining powers, a surface of weights, and implementation of the Nash bargaining solution
- Trading bargaining weights
- On the relation between the Nash bargaining solution and the weighting method
- An extension of the Nash bargaining problem and the Nash social welfare function
- An extension of the Nash bargaining solution to nonconvex problems
- Axiomatic models of bargaining
- Extending Nash's axioms to nonconvex problems
- scientific article; zbMATH DE number 3155240 (Why is no real title available?)
- scientific article; zbMATH DE number 44383 (Why is no real title available?)
- Implementation of Nash bargaining solutions with non-convexity
- Individual Rationality and Nash's Solution to the Bargaining Problem
- Nash bargaining for log-convex problems
- Nash social welfare orderings.
- Nonconvex n-person bargaining: efficient maxmin solutions
- Nonsymmetric Nash solutions and replications of 2-person bargaining
- The bargaining problem
- The Determination of Price and Output Quotas in a Heterogeneous Cartel
- The Nash Bargaining Theory with Non-Convex Problems
- The Nash program: Non-convex bargaining problems
- Two-Person Cooperative Games
- WPO, COV and IIA bargaining solutions for non-convex bargaining problems
- Replication invariance of bargaining solutions
- WPO, COV and IIA bargaining solutions for non-convex bargaining problems
- On the convergence to the Nash bargaining solution for action-dependent bargaining protocols
- Nash bargaining theory when the number of alternatives can be finite
- Trading bargaining weights
- Bargaining powers, a surface of weights, and implementation of the Nash bargaining solution
- The Constrained Nash Bargaining Solution
This page was built for publication: On iterated Nash bargaining solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6136266)
