Existing literature regarding the natural hedge potential that arises from combining liabilities with different sensitivities focuses on the optimal liability mix, but does not address the question whether and how changes in the liability mix can be obtained. In the absence of a well-functioning...

This paper analyses bargaining over an incentive compatible contract in a moral hazard framework. We introduce the Kalai-Smorodinsky bargaining solution and compare the outcome with the commonly applied Nash solution. Whether worker's effort is higher in the Nash or the Kalai-Smorodinsky...

We analyse the two-dimensional Nash bargaining solution (NBS) deploying a standard labour market negotiations model (McDonald and Solow, 1981). We show that the two-dimensional bargaining problem can be decomposed into two one-dimensional problems such that the two solutions together replicate...

We introduce a model of product development in a firm. Our model describes the process as a multi-stage contest (i.e., race) with an endogenous length (with one stage or two stages) between two workers. We model the payments to workers from the new product using the normatively appealing Nash...

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

Suppose that the agents of a matching market contact each other randomly and form new pairs if is in their interest. Does such a process always converge to a stable matching if one exists? If so, how quickly? Are some stable matchings more likely to be obtained by this process than others? In...

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

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

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