A binary relation is indifference-transitive if its symmetric part satisfies the transitivity axiom. We investigated the properties of Arrovian aggregation rules that generate acyclic and indifference-transitive social preferences. We proved that there exists unique vetoer in the rule if the...

We axiomatize the Kalai-Smorodinsky solution (1975) in the Nash bargaining problems if the feasible sets can be finite. We show that the Kalai-Smorodinsky solution is the unique solution satisfying Continuity (in the Hausdorff topology endowed with payoffs space), Independence (which is weaker...