Strategyproof matching with regional minimum and maximum quotas

This paper considers matching problems with individual/regional minimum/maximum quotas. Although such quotas are relevant in many real-world settings, there is a lack of strategyproof mechanisms that take such quotas into account. We first show that without any restrictions on the regional structure, checking the existence of a feasible matching that satisfies all quotas is NP-complete. Then, assuming that regions have a hierarchical structure (i.e., a tree), we show that checking the existence of a feasible matching can be done in time linear in the number of regions. We develop two strategyproof matching mechanisms based on the Deferred Acceptance mechanism (DA), which we call Priority List based Deferred Acceptance with Regional minimum and maximum Quotas (PLDA-RQ) and Round-robin Selection Deferred Acceptance with Regional minimum and maximum Quotas (RSDA-RQ). When regional quotas are imposed, a stable matching may no longer exist since fairness and nonwastefulness, which compose stability, are incompatible. We show that both mechanisms are fair. As a result, they are inevitably wasteful. We show that the two mechanisms satisfy different versions of nonwastefulness respectively; each is weaker than the original nonwastefulness. Moreover, we compare our mechanisms with an artificial cap mechanism via simulation experiments, which illustrate that they have a clear advantage in terms of nonwastefulness and student welfare

A Weak Bargaining Set for Contract Choice Problems

In this paper, we consider the problem of choosing a set of multi-party contracts, where each coalition of agents has a non-empty finite set of feasible contracts to choose from. We call such problems, contract choice problems. The main result of this paper states that every contract choice problem has a non-empty weak bargaining set. The need for such a solution concept which is considerably weaker than the core arises, since it is well known that even for very simple contract choice problems, the core may be empty. We also show by means of an example that the bargaining set due to Mas-Colell (1989), as well as a weaker version of it, may be empty for contract choice problems, thereby implying that the weakening we suggest is in some ways “tight”Weak bargaining set, Contract choice, NTU game, Matching

Filling position incentives in matching markets

One of the main problems in the hospital-doctor matching is the maldistribution of doctor assignments across hospitals. Namely, many hospitals in rural areas are matched with far fewer doctors than what they need. The so called "Rural Hospital Theorem" (Roth (1984)) reveals that it is unavoidable under stable assignments. On the other hand, the counterpart of the problem in the school choice context|low enrollments at schools| has important consequences for schools as well. In the current study, we approach the problem from a different point of view and investigate whether hospitals can increase their filled positions by misreporting their preferences under well-known Boston, Top Trading Cycles, and stable rules. It turns out that while it is impossible under Boston and stable mechanisms, Top Trading Cycles rule is manipulable in that sense

The Principal-Agent Matching Market

We propose a model based on competitive markets in order to analyse an economy with several principals and agents. We model the principal-agent economy as a two-sided matching game and characterise the set of stable outcomes of this principal-agent matching market. A simple mechanism to implement the set of stable outcomes is proposed. Finally, we put forward examples of principal-agent economies where the results fit.principal-agent, moral hazard, matching, implementation