We consider upper and lower bounds for maxmin allocations of a completely divisible good in both competitive and cooperative strategic contexts. We then derive a subgradient algorithm to compute the exact value up to any fixed degree of precision. -- Fair Division ; Maxmin Allocation ; Kalai...

The aim of this paper is to propose a new solution for the roommate problem with strict references. We introduce the solution of maximum irreversibility and consider almost stable matchings (Abraham et al. [2]) and maximum stable matchings (Tan [30] [32]). We find that almost stable matchings...

In this paper we investigate some new applications of Scarf's Lemma. First, we introduce the notion of fractional core for NTU-games, which is always nonempty by the Lemma. Stable allocation is a general solution concept for games where both the players and their possible cooperations can have...

The stable roommates problem with payments has as input a graph G(E,V) with an edge weighting w:E→R+ and the problem is to find a stable solution. A solution is a matching M with a vector pϵRV that satisfies 􂀀pu+pv=w(uv) for all uvϵM and pu=0 for all u unmatched in M. A solution is stable...

A matching game is a cooperative game (N; v) defined on a graph G = (N;E) with an edge weighting w : E → R+. The player set is N and the value of a coalition S C̱ N is defined as the maximum weight of a matching in the subgraph induced by S. First we present an O (nm+n2 log n) algorithm that...

In this paper we propose a new rule to allocate risk capital to portfolios or divisions within a firm. Specifically, we determine the capital allocation that minimizes the excesses of sets of portfolios in lexicographical sense. The excess of a set of portfolios is defined as the expected loss...

Supply chains today routinely use third parties for many strategic activities, such as manufacturing, R&D, or software development. These activities often include relationship-specific investment on the part of the vendor, while final outcomes can be uncertain. Therefore, writing complete...

Channel sharing is an important marketing strategy for giant retailers who sell their own store brands and resell national brands for cooperative manufacturers simultaneously. To expand their market and increase profitability, national brand manufacturers may consider entering the online market...

We provide two new characterizations of exact games. First, a game is exact if and only if it is exactly balanced; and second, a game is exact if and only if it is totally balanced and overbalanced.The condition of exact balancedness is identical to the one of balancedness, except that one of the...

This paper analyzes congestion effects on network situations from a cooperative game theoretic perspective. In network situations players have to connect themselves to a source. Since we consider publicly available networks any group of players is allowed to use the entire network to establish...