We introduce a simple, but fundamental problem called Student-Project-Resource matching-
allocation problem (SPR). 1 On one hand, SPR can be considered as a two-sided, many-to …

We introduce a new type of distributional constraints called ratio constraints, which explicitly
specify the required balance among schools in two-sided matching. Since ratio constraints …

We study a problem where each school has flexible multi-ranked diversity goals, and each
student may belong to multiple overlap** types, and consumes only one of the positions …

We identify a new class of distributional constraints defined as a union of symmetric M-
convex sets, which can represent a wide range of real-life constraints in two-sided matching …

The past few years have seen a surge of work on fairness in allocation problems where
items must be fairly divided among agents having individual preferences. In comparison …

The many-to-one matching problem is a fundamental issue involving the allocation of two
sets of agents based on their preferences. Each agent belongs to one set (which we call …

Stable matchings have been studied extensively in social choice literature. The focus has
been mostly on integral matchings, in which the nodes on the two sides are wholly matched …