A (point-valued) solution for cooperative games with transferable utility, or simply TU-games, assigns a payoff vector to every TU-game. In this paper we discuss two classes of equal surplus sharing solutions, one consisting of all convex combinations of the equal division solution and the...

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...

In this paper, we study the implications of extending the balanced cost reduction property from queueing problems to general games. As a direct translation of the balanced cost reduction property, the axiom of balanced externalities for solutions of games, requires that the payoff of any player...

Complementary to the axiomatic and mechanism design studies on queueing problems, this paper proposes a strategic bargaining approach to resolve queueing conflicts. Given a situation where players with different waiting costs have to form a queue in order to be served, they firstly compete with...

We present axiomatic characterizations of the proportional division value for TU-games, a value that distributes the worth of the grand coalition in proportion to the stand-alone worths of its members. First, a new proportionality principle, called balanced treatment, is introduced by...

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...