Balanced Consistency and Balanced Cost Reduction for Sequencing Problems

We investigate the implications of imposing balanced consistency and balanced cost reduction in the context of sequencing problems. Balanced consistency requires that the effect on the payoff from the departure of one agent to another agent should be equal between any two agents. On the other hand, balanced cost reduction requires that if one agent leaves a problem, then the total payoffs of the remaining agents should be affected by the amount previously assigned to the leaving agent. We show that the minimal transfer rule is the only rule satisfying efficiency and Pareto indifference together with either one of our two main axioms, balanced consistency and balanced cost reduction.