An exact non-cooperative support for the sequential Raiffa solution

This article provides an exact non-cooperative foundation of the sequential Raiffa solution for two person bargaining games. Based on an approximate foundation due to Myerson (1997) for any two-person bargaining game (S,d) an extensive form game G^S^d is defined that has an infinity of weakly subgame perfect equilibria whose payoff vectors coincide with that of the sequential Raiffa solution of (S,d). Moreover all those equilibria share the same equilibrium path consisting of proposing the Raiffa solution and accepting it in the first stage of the game. By a modification of G^S^d the analogous result is provided for subgame perfect equilibria. Finally, it is indicated how these results can be extended to implementation of a sequential Raiffa (solution based) social choice rule in subgame perfect equilibrium. -- Raiffa solution ; Non-cooperative foundation ; Nash program ; Implementation ; Solution based social choice rule