This paper provides four axioms that uniquely characterize the sequential Raiffa solution proposed by Raiffa (1951, 1953) for two-person bargaining games. Three of these axioms are standard and are shared by several popular bargaining solutions. They suffice to characterize these solutions on...

Howard (1992) argues that the Nash bargaining solution is not Nash implementable, as it does not satisfy Maskin monotonicity. His arguments can be extended to other bargaining solutions as well. However, by defining a social choice correspondence that is based on the solution rather than on its...

Howard (1992) argues that the Nash bargaining solution is not Nash implementable, as it does not satisfy Maskin monotonicity. His arguments can be extended to other bargaining solutions as well. However, by defining a social choice correspondence that is based on the solution rather than on its...

This paper provides four axioms that uniquely characterize the sequential Raiffa solution proposed by Raiffa (1951, 1953) for two-person bargaining games. Three of these axioms are standard and are shared by several popular bargaining solutions. They suffice to characterize these solutions on...

First via a counter example it is shown that Proposition 3 of Anbarci and Sun (2013) is false. Then a gap and a mistake in their proof are identified. Finally, a modified version of their Proposition 3 is stated and proved.