SearcharxivSearch

arXiv · 1406.3327

Trade-offs in School Choice: Comparing Deferred Acceptance, the Naive and the Classic Boston Mechanism

Abstract

The three most common school choice mechanisms are the Deferred Acceptance mechanism (DA), the classic Boston mechanism (BM), and a variant of the Boston mechanism where students automatically skip exhausted schools, which we call the adaptive Boston mechanism (ABM). Assuming truthful reporting, we compare student welfare under these mechanisms both from a conceptual and from a quantitative perspective: We first show that, BM rank dominates DA whenever they are comparable; and via limit arguments and simulations we show that ABM yields intermediate student welfare between BM and DA. Second, we perform computational experiments with preference data from the high school match in Mexico City. We find that student welfare (in terms of rank transitions) is highest under BM, intermediate under ABM, and lowest under DA. BM, ABM, and DA can thus be understood to form a hierarchy in terms of student welfare. In contrast, in (Mennle and Seuken, 2017), we have found that the same mechanisms also form a hierarchy in terms of incentives for truthtelling that points in the opposite direction. A decision between them therefore involves an implicit trade-off between incentives and student welfare.

Explore related subjects

Keep this discovery

BibTeXRIS

Timo Mennle, Sven Seuken. 2014-06-12. Trade-offs in School Choice: Comparing Deferred Acceptance, the Naive and the Classic Boston Mechanism. https://arxiv.org/abs/1406.3327

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

MMS Allocation for Chores with Online Agent Arrivals

We study the fair allocation of $m$ indivisible chores to $n$ agents with subadditive cost functions arriving online in an arbitrary order. Upon an agent's arrival, we are informed of her cost function and must irrevocably assign her a set of chores. We focus on the Maximin Share (MMS) fairness notion and aim to compute an allocation in which all items are assigned, and no agent incurs a cost more than $\alpha$ times her MMS. Without any prior information about the instance (other than $n$ and $m$), we design an algorithm with a competitive ratio of $O(\min\{n, k\log^{1+\epsilon}k, \log m\})$ for any constant $\epsilon > 0$, where $k$ denotes the number of cost function types. Our bound matches the best known offline approximation guarantees for MMS under subadditive costs and is nearly optimal with respect to all three parameters: we show that even for binary additive cost functions, no online algorithm can achieve a competitive ratio of $o(\min\{n, k\log k, \log m\})$. We then consider the setting in which the $k$ cost function types are known in advance (though the realized types of arriving agents are not). For additive cost functions, we provide an algorithm with a competitive ratio of $O(\min\{\log k, \log(kn)/\log\log(kn)\})$, and show that constant-competitive algorithms do not exist for general $k$, even for the binary additive setting. For binary additive functions when $k \le n$, we propose a $3$-competitive algorithm and establish a lower bound of $2$.

cs.GT

Truncated Noisy Best-Response Algorithms: Toward Game Theoretic Learning with Safety Guarantees

We consider a game theoretic approach to solve multi-agent coordination problems with submodular maximization objectives. It is known for such problems that the Nash equilibria for the corresponding game are always within 50% of the optimal, but that the equilibria which achieve this worst-case bound are not stable. To exploit this instability, we propose a family of algorithms which we call Truncated Noisy Best-Response (TNBR) Algorithms. These algorithms are flexibly characterized by agents asynchronously and stochastically selecting actions from a neighbourhood of their best response payoffs. We compute bounds on the recurrent classes of TNBR algorithms' associated Markov chains. Our bounds fall into two categories: first, "Performance" bounds ensure that TNBR algorithms always have a high-value recurrent state; second, "Safety" bounds ensure that TNBR algorithms never have arbitrarily-bad recurrent states. Furthermore, these two types of bounds are linked by a waterbed-like effect: every game with a poor Safety guarantee necessarily has a favorable Performance guarantee.

cs.GT

Existence of the Core in Approval-Based Committee Elections

We settle the main open question in the theory of approval-based multi-winner elections: we show that there always exists a committee in the core. The core is a stability and group fairness concept. The proof introduces a new voting rule that optimizes an entropy-like objective function over committees and payment systems. All local optima of this objective function lie in the core, which implies that a core committee can be found in polynomial time.

cs.GT