We generalize two well-known game-theoretic models by introducing multiple partners matching games, defined by a graph G = (N;E), with an integer vertex capacity function b and an edge weighting w. The set N consists of a number of players that are to form a set M is a subset of E of 2-player...

In this article, we analyze the stability of couples on the marriage market. Recent developments in cooperative game theory allow a new model that uses team games which make it possible to model the marriage market. Coalition structures can model couples. We analyze two cases: a symmetrical one...

In this paper, we study different notions of stability for three-sided assignment games. Since the core may be empty in this case, we first focus on other notions of stability such as the notions of subsolution and von Neumann-Morgenstern stable sets. The dominant diagonal property is necessary...

In a liability problem, the asset value of an insolvent firm must be distributed among the creditors and the firm itself, when the firm has some freedom in negotiating with the creditors. We model the negotiations using cooperative game theory and analyze the Shapley value to resolve such...

We extend the analysis of van Damme (1987, Section 7.5) of the famous smoothing demand in Nash (1953) as an argument for the singular stability of the symmetric Nash bargaining solution among all Pareto efficient equilibria of the Nash demand game. Van Damme's analysis provides a clean...

The value is a solution concept for n-person strategic games, developed by Nash, Shapley, and Harsanyi. The value of a game is an a priori evaluation of the economic worth of the position of each player, reflecting the players' strategic possibilities, including their ability to make threats...

Strategy-proofness (SP) is a sought-after property in social choice functions because it ensures that agents have no incentive to misrepresent their private information at both the interim and ex post stages. Group strategy-proofness (GSP), however, is a notion that is applied to the ex post...

In this paper we considered the classical Shapley-Scarf (1974) "house allocation model", where in addition there is a perfectly divisible good (money). The problem is to characterize all strategy-proof, nonbossy and individually rational allocation mechanisms. The finding is that only a...

A fair division problem with indivisible objects, e.g. jobs, and one divisible good (money) is considered. The individuals consume one object and money. The class of strategy-proof and fair allocation rules is characterized. The allocation rules in the class are like a Vickrey auction bossy and...

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