SearcharxivSearch

arXiv · 2605.25990

The Impact of Competition on Outcomes of Score-Based College Admissions

Abstract

We study how the design of admissions policies affects the ability of students admitted to universities. In our model, applicants have a multi-dimensional ability, which is a combination of a "type" and a "soft skill." Universities may differ in how they evaluate quality and have differing preferences on type and soft skills. Then, university admissions rely on a single noisy aggregate signal, such as a test score, that may not fully align with the university's preferences, and a university evaluates applicants through the posterior expectations of their preference metric given the observed signal. Our main results highlight that the design of good admission policies can be counter-intuitive. Under a single university, when holding the number of qualified applicants constant, increasing the usefulness of the signal (by aligning it more closely with the university preferences) leads to a worse type and soft skill for admitted students. Further, a university cannot affect the composition of students that are strong on type versus soft skills by changing their preferences. The picture becomes even more complicated under competition between as few as two universities: self-selection effects among students admitted to both universities can lead to part of the applicant pool switching which university they prefer, even under small changes in the design of the noisy signal. This can, in particular, lead to sudden and non-monotonic loss in the quality of admitted students when changing the alignment between signal and university preferences. Further, a university can get more students by increasing their selectivity. Finally, when admissions rely on separate noisy scores for type and for soft skills, we show that universities that put more emphasis on type (respectively soft skills) end up, counter-intuitively, admitting students with higher soft skills (respectively type).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

George Bentley, Diptangshu Sen, Juba Ziani. 2026-05-25. The Impact of Competition on Outcomes of Score-Based College Admissions. https://arxiv.org/abs/2605.25990

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