Inferring Optimal Peer Assignment From Experimental Data
从实验数据推断最优同伴分配AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要同时涉及实验识别的同伴效应、同伴分组优化及成绩分位数等分布目标。
从实验数据推断最优同伴分配AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
This article studies the problem of optimally dividing individuals into peer groups to maximize social gains from heterogeneous peer effects. The specific setting analyzed here concerns efficient ways of allocating roommates in college dormitories. Using confidential data on a sample of Dartmouth College freshmen who were randomly assigned to be roommates, the article derives efficient roommate pairing rules, based on demographic and academic background, which maximize different aggregate outcomes. Segregation by precollege academic standing and by race are seen to minimize mean enrolment into sororities and maximize mean enrolment into fraternities. Segregation has no effect on mean and median freshman year grade point average (GPA) but increases the higher and decreases the lower percentiles of the GPA distribution for both men and women. Efficiency loss due to legal constraints on allocations (e.g., race-blindness) is shown to be significant and also larger for women for whom peer effects are more nonlinear. The article develops large-sample inference methods for these optimal solutions and the resulting optimized values by using and extending insights from the mathematical programming literature. Applicability of these techniques extends beyond linear maximands such as the mean to other important policy objectives such as outcome quantiles, which, though nonlinear, are shown to be quasi-convex in the allocation probabilities.