Previous allocation rules for network games, such as the Myerson Value, implicitly or explicitly take the network structure as fixed. In many situations, however, the network structure can be altered by players. This means that the value of alternative network structures (not just sub-networks)...

We study problems of allocating objects among people. Some objects may be initially owned and the rest are unowned. Each person needs exactly one object and initially owns at most one object. We drop the common assumption of strict preferences. Without this assumption, it suffices to study...

As oil refining is a multiproduct industrial activity, there are innumerable ways to allocate a refinery’s CO2 emissions among the various refined products. The linear-programming models used to manage refineries may serve to compute the marginal contribution of each finished product to the...

This paper deals with a new class of multi-choice games, the class of multi-choice total clan games. The structure of the core of a multi-choice clan game is explicitly described. Furthermore, characterizations of multi-choice total clan games are given and bi-monotonic allocation schemes...

In this paper we introduce games with optimistic aspirations and identify attractive allocation rules for such games through axiomatizations. A game with optimistic aspirations specifies two values for each coalition of players: the first value is the worth that the players in the coalition can...

Previous allocation rules for network games, such as the Myerson Value, implicitly or explicitly take the network structure as fixed. In many situations, however, the network structure can be altered by players. This means that the value of alternative network structures (not just sub-networks)...

We study marriage problems where two groups of agents match to each other and probabilistic assignments are possible. When only ordinal preferences are observable, an extensively studied efficiency notion is stochastic dominance efficiency (sd-efficiency). First, we provide a characterization of...

When allocating indivisible objects, agents might have equal priority rights for some objects. A common practice is to break the ties using a lottery and randomize over deterministic allocation mechanisms. Such randomizations usually lead to unfairness and inefficiency ex-ante. We propose a...

We consider the problem of sharing water among agents located along a river. Each agent has quasi-linear preferences over river water and money, where the benefit of consuming an amount of water is given by a continuous and concave benefit function. A solution to the problem efficiently...