We study a labor market with finitely many heterogeneous workers and firms to illustrate the decentralized (myopic) blocking dynamics in two-sided one-to-one matching markets with continuous side payments (assignment problems, Shapley and Shubik, 1971). A labor market is unstable if there is at...

Pairing Games or Markets studied here are the non-two-sided NTU generalization of assignment games. We show that the Equilibrium Set is nonempty, that it is the set of stable allocations or the set of semistable allocations, and that it has several notable structural properties. We also...

In this paper we consider one-to-many matching problems where the preferences of the agents involved are represented by monetary reward functions. We characterize Pareto optimal matchings by means of contractually exchange stability and matchings of maximum total reward by means of compensation...

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

It is known that in two-sided many-to-many matching markets, pair-wise stability is not logically related with the (weak) core, unlike in many-to-one matching markets (Blair, 1988). In this paper, we seek a theoretical foundation for pairwise stability when group deviations are allowed. Group...

In this article, we use a stylized model of the labor market to investigate the effects of three alternative and well-known bargaining solutions. We apply the Nash, the Egalitarian and the Kalai-Smorodinsky bargaining solutions in the small firm's matching model of unemployment. To the best of...

In this article, we use a stylized model of the labor market to investigate the effects of three alternative and well-known bargaining solutions. We apply the Nash, the Egalitarian and the Kalai-Smorodinsky bargaining solutions in the small firm's matching model of unemployment. To the best of...

In this paper, we establish sufficient conditions on the domain of preferences and agents' behavior in order to characterize the existence of stable assignments in many-to-one matching problems with externalities. The set of stable matchings depends on what agents believe other agents will do if...

We study the existence of group strategy-proof stable rules in many-to-many matching markets under responsiveness of agents' preferences. We show that when firms have acyclical preferences over workers the set of stable matchings is a singleton, and the worker-optimal stable mechanism is a...