The equitable division of a joint cost (or a jointly produced output) among agents with different shares or types of output (or input) commodities, is a central theme of the theory of cooperative games with transferable utility. Ever since Shapley's seminal contribution in 1953, this question...

In a dynamic model of assignment problems, small deviations suffice to move between stable outcomes. This result is used to obtain no-selection and almost-no-selection results under the stochastic stability concept for uniform and payoff-dependent errors. There is no-selection of partner or...

A group of agents are waiting for their job to be processed in a facility. We assume that each agent needs the same amount of processing time and incurs waiting costs. The facility has two parallel servers, being able to serve two agents at a time. We are interested in finding the order to serve...

One-sided assignment problems combine important features of two well-known matching models. First, as in roommate problems, any two agents can be matched and second, as in two-sided assignment problems, the payoffs of a matching can be divided between the agents. We take a similar approach to...

In a claims problem, we propose a new game for strategic justification of the constrained equal awards rule. In contrast to Li and Ju (Mimeo, 2016) and Tsay and Yeh (Games and Economic Behavior, 113, 515-532, 2019), our game is "procedurally fair" (claimants are treated equally) and...

We show that any transferable utility game can be represented by an assignment of facilities to players, in which it is intuitively obvious how to allocate the total cost of the facilities. The intuitive solution in the representation turns out to be the Shapley value of the game, and thus...

This paper studies egalitarianism in the context of nontransferable utility games by introducing and analyzing the egalitarian value. This new solution concept is based on an egalitarian negotiation procedure in which egalitarian opportunities of coalitions are explicitly taken into account. We...

Multiple causation is one of the most intricate issues in contemporary tort law. Sharing a loss suffered by a victim among multiple tortfeasors is indeed difficult and Courts do not always follow clear and consistent principles. Here, we argue that the axiomatic approach provided by the theory...

Minimum-cost spanning tree problems are well-known problems in the operations research literature. Some agents, located at different geographical places, want a service provided by a common supplier. Agents will be served through costly connections. Some part of the literature has focused,...

A common real-life problem is to fairly allocate a number of indivisible objects and a fixed amount of money among a group of agents. Fairness requires that each agent weakly prefers his consumption bundle to any other agent's bundle. In this context, fairness is incompatible with budget-balance...