We generalize the school choice problem by defining a notion of allowable priority violations. In this setting, a weak axiom of stability (partial stability) allows only certain priority violations. We introduce a class of algorithms called the Student Exchange under Partial Fairness (SEPF)....

A set of indivisible objects is allocated among agents with strict preferences. Each object has a weak priority ranking of the agents. A collection of priority rankings, a priority structure, is solvable if there is a strategy-proof mechanism that is constrained efficient, i.e. that always...

For school choice (priority-based allocation) problems, when the priority structure is acyclic, the associated student-proposing deferred acceptance algorithm is Pareto efficient and group strategy-proof (Ergin, 2002). We reveal a hidden iterative removal structure behind such deferred...

A large portion of school and college places in the world are allocated through centralized admissions schemes. In this paper, we study a model of centralized admissions with the feature that schools are allowed to pre-commit to admitting qualified applicants who rank them as top choice over...

Empirical and experimental evidence suggests different levels of sophistication among families in the Boston Public School student assignment plan. In this paper, we analyze the Nash equilibria of the preference revelation game induced by the Boston mechanism when there are two types of players....

For priority-based allocation of indivisible objects to agents with unit demand, when each object has exactly one copy, Abdulkadiroglu et al. (2019) show that the priority-based top trading cycles mechanism is justified envy minimal, in the sense that no strategy proof and Pareto efficient...

The prevalent affirmative action policy in school choice limits the number of admitted majority students to give minority students higher chances to attend their desired schools. There have been numerous efforts to reconcile affirmative action policies with celebrated matching mechanisms such as...

An allocation of indivisible items among n ≥ 2 players is proportional if and only if each player receives a proportional subset—one that it thinks is worth at least 1/n of the total value of all the items. We show that a proportional allocation exists if and only if there is an allocation...

Which budgetary institutions result in efficient provision of public goods? We analyze a model with two parties bargaining over the allocation to a public good each period. Parties place different values on the public good, and these values may change over time. We focus on budgetary...

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