Nash (1950) considered a domain of convex bargaining problems. We analyse domains including, or even consisting of, finite problems and provide various characterisations of the Nash Bargaining Solution (NBS). In particular, we extend Kaneko's (1980) results.</p
The Nash Bargaining Solution is characterised by using the new axiom of Maximal Symmetry in place of...
The “Nash program” initiated by Nash (Econometrica 21:128–140, 1953) is a research agenda aiming at ...
We introduce log-convexity for bargaining problems. We show that the class of all regular and log-co...
Nash (1950) considered a domain of convex bargaining problems. We analyse domains including, or even...
We reconsider the three well-known solutions: the Nash, the egal-itarian and the Kalai-Smorodinsky s...
Nash's axioms are extended to a domain of nonconvex problems to characterise in a simple way the Ext...
This paper studies compact and comprehensive bargaining prob-lems for n players and axiomatically ch...
This paper studies compact and comprehensive bargaining prob-lems for n players and axiomatically ch...
This paper studies the Nash solution to nonconvex bargaining problems. The Nash solution in such a c...
Conditions α and β are two well-known rationality conditions in the theory of rational choice. This ...
We present a characterization of the Nash Bargaining Solution on a domain which is not closed under ...
We characterize all n-person multi-valued bargaining solutions, defined on the domain of all finite ...
Abstract We analyze bilateral bargaining over a finite set of alternatives. We look for “good ” ordi...
A bargaining problem and its solutions are considered in an axiomatic model. We start with a descrip...
The class of bargaining solutions that are defined on the domain of finite sets of alterna-tives and...
The Nash Bargaining Solution is characterised by using the new axiom of Maximal Symmetry in place of...
The “Nash program” initiated by Nash (Econometrica 21:128–140, 1953) is a research agenda aiming at ...
We introduce log-convexity for bargaining problems. We show that the class of all regular and log-co...
Nash (1950) considered a domain of convex bargaining problems. We analyse domains including, or even...
We reconsider the three well-known solutions: the Nash, the egal-itarian and the Kalai-Smorodinsky s...
Nash's axioms are extended to a domain of nonconvex problems to characterise in a simple way the Ext...
This paper studies compact and comprehensive bargaining prob-lems for n players and axiomatically ch...
This paper studies compact and comprehensive bargaining prob-lems for n players and axiomatically ch...
This paper studies the Nash solution to nonconvex bargaining problems. The Nash solution in such a c...
Conditions α and β are two well-known rationality conditions in the theory of rational choice. This ...
We present a characterization of the Nash Bargaining Solution on a domain which is not closed under ...
We characterize all n-person multi-valued bargaining solutions, defined on the domain of all finite ...
Abstract We analyze bilateral bargaining over a finite set of alternatives. We look for “good ” ordi...
A bargaining problem and its solutions are considered in an axiomatic model. We start with a descrip...
The class of bargaining solutions that are defined on the domain of finite sets of alterna-tives and...
The Nash Bargaining Solution is characterised by using the new axiom of Maximal Symmetry in place of...
The “Nash program” initiated by Nash (Econometrica 21:128–140, 1953) is a research agenda aiming at ...
We introduce log-convexity for bargaining problems. We show that the class of all regular and log-co...
DOI
Add to ORKG