This survey captures the main contributions in the area described by the title that were published up to 1997. (Unfortunately, it does not capture all of them.) The variations that are the subject of this chapter are those axiomatically characterized solutions which are obtained by varying...

A learning process is belief affirming if for each player, the difference between her expected payoff in the next period, and the average of her past payoffs converges to zero. We show that every smooth discrete fictitious play and every continuous fictitious play is belief affirming. We also...

Several authors have indicated a contradiction between consistent aggregation of subjective beliefs and tastes, and a Pareto condition. We argue that the Pareto condition that implies the contradiction is not compelling. Society should not necessarily endorse a unanimous choice when it is based...

We define a family of solutions for n-person bargaining problems which generalizes the discrete Raiffa solution and approaches the continuous Raiffa solution. Each member of this family is a stepwise solution, which is a pair of functions: a step-function that determines a new disagreement point...