College Applications with Non-Homogeneous Application Costs

A college applicant submits costly applications to a set of colleges while uncertain which colleges will admit her. If she knows the application costs, her utility of attending each college, and her probability of being admitted to each college, which subset of colleges should she apply to maximize her expected net payoff? The problem is an instance of non-monotone submodular maximization. There are two principal variants in the literature, one where the events of getting into different colleges are independent, and the other where they are correlated. The main results in the literature handle cases where all application costs are the same. We provide exact and approximate algorithms for the problem when college application costs vary.

Authors

Institutions

Publication Details

Journal
ACM Transactions on Economics and Computation
Published
2026-02-03
DOI
https://doi.org/10.1145/3795138
Primary Topic
Game Theory and Voting Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

College Applications with Non-Homogeneous Application Costs

Rakesh Vohra, Eshwar Ram Arunachaleswaran, Sampath Kannan
ACM Transactions on Economics and Computation
Game Theory and Voting Systems
article

College Applications with Non-Homogeneous Application Costs

Rakesh Vohra, Eshwar Ram Arunachaleswaran, Sampath Kannan
article en

Abstract

A college applicant submits costly applications to a set of colleges while uncertain which colleges will admit her. If she knows the application costs, her utility of attending each college, and her probability of being admitted to each college, which subset of colleges should she apply to maximize her expected net payoff? The problem is an instance of non-monotone submodular maximization. There are two principal variants in the literature, one where the events of getting into different colleges are independent, and the other where they are correlated. The main results in the literature handle cases where all application costs are the same. We provide exact and approximate algorithms for the problem when college application costs vary.

ACM Transactions on Economics and Computation
California University of Pennsylvania (US), University of Pennsylvania (US)
Openalex Percentile: Top 74%
Game Theory and Voting Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.