Testing random assignment to peer groups
同伴群体随机分配的检验AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要以同伴效应和同伴群体分配为对象,并检验支撑因果识别的近似随机分配。
同伴群体随机分配的检验AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Summary Identification of peer effects is complicated by the fact that the individuals under study may select their peers. Random assignment to peer groups has proven useful to sidestep such a concern. In the absence of a formal randomization mechanism, it needs to be argued that assignment is “as good as” random. This paper introduces a simple yet powerful test to do so. We provide theoretical results for this test. As a by‐product, we equally obtain such results for an approach popularized by Guryan et al. (2009). These results help to explain why this approach suffers from low power, as has been observed elsewhere.