Sharing with Friends: Job Information and Social Networks

How to cite

Chiplunkar, Gaurav; Lane, Gregory; Kelley, Erin. 2021. "Sharing with Friends: Job Information and Social Networks." AEA RCT Registry. AEARCTR-0007564. https://doi.org/10.1257/rct.7564-2.0

Download: BibTeX · RIS — for reference managers without a browser translator. Zotero and most others pick up this page's citation metadata directly.

Gaurav Chiplunkar* , Gregory Lane , Erin Kelley

* Primary investigator

Registry ID
AEARCTR-0007564
DOI
https://doi.org/10.1257/rct.7564-2.0
First registered
Last updated
Status
On going
Trial dates
2021-03-01 – 2022-03-31
Countries
India (Mumbai)
Registry record
http://www.socialscienceregistry.org/trials/7564

Abstract

Social networks are recognized to be important for labor market outcomes as job seekers rely upon their networks to find jobs. However, there is limited evidence about specifically what kind of job information flows through networks and how agents choose to disclose information with their connections. This project seeks to investigate these mechanisms through an experiment that varies the availability of job information and competition for the job among graduating college students in India. We then track how this information flows among student cohorts.

Intervention

For a period of six weeks, we design a small work-task (a “gig”) that takes approximately 30-45 minutes each week. The task involves finding five policy relevant articles on a particular topic for a researcher. The applicant must then summarize each article. Each week we change the type or article they have to find. For example we ask them to evaluate government policies in health one week, education the next, agriculture the next, or women’s empowerment.

While the task is identical across all groups in a given week, we experimentally vary two aspects: first, the wage i.e. for some batches/colleges, the task offers USD 5, whereas for others it offers USD 10. Second, we vary the "rivalry" in application for the task i.e. either make recruitment a rival or a non-rival activity. For non-rival recruitment, we tell a treated student that: "Here is a small task that will take 30-45 mins of your time and will pay you INR XX. This position is guaranteed to you if you decide to apply for it. There are limited spots and we are considering hiring others in their batch if you’d like to spread the word to others in your batch and encourage them to apply." For the rival recruitment, we tell a treated student that: "Here is a small task that will take 30-45 mins of your time and will pay you INR XX. There are limited spots and you can apply for this position as well as spread the word to others in your batch and encourage them to apply."

Experimental design

For each week, each batch will be allocated to one of four treatment groups or a control group. As mentioned before, we vary two aspects about the job, namely the wage (High and Low) and the number of students who will be recruited for the job (Rival and Non-Rival). Each week we select a new subset of students within the batch to hear about the job. Selected treatment job-seekers from each college are therefore assigned to one of four groups each week: {High Wage, Non-Rival}, {High Wage, Rival}, {Low Wage, Non-Rival}, {Low Wage, Rival}. Treated students are provided with a unique referral code which they can share with their friends. These friends must enter in this referral code when they apply, which enables us to track the spread of information within the social network.

Design details

Randomization method
Computer
Randomization unit
Individual
Clusters
23 courses across 6 colleges
Observations
500 students
Arms
20-30% of students within each batch will be selected for treatment, while the others will be in the control group.
Primary outcomes
Job applications, knowledge of job openings, information sharing decision
Secondary outcomes
Performance on the job, heterogeneity by identify of recipient / provider of information

Cited by

No citation data available for this registration yet.

Keywords