Show Summary Details

Page of

PRINTED FROM OXFORD HANDBOOKS ONLINE (www.oxfordhandbooks.com). © Oxford University Press, 2018. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a title in Oxford Handbooks Online for personal use (for details see Privacy Policy and Legal Notice).

date: 19 October 2019

Abstract and Keywords

This chapter considers the design and analysis of networked experiments. As a result of digitization, the scale, scope, and complexity of networked experiments have expanded significantly in recent years, creating a need for more robust design and analysis strategies. This chapter first reviews innovations in networked experimental design, assessing the implications of the experimental setting, sampling, randomization procedures, and treatment assignment. Then the analysis of networked experiments is discussed, with particular emphasis on modeling treatment response assumptions, inference, and estimation, and recent approaches to interference and uncertainty in dependent data. The chapter concludes by discussing important challenges facing the future of networked experimentation, focusing on adaptive treatment assignment, novel randomization techniques, linking online treatments to offline responses, and experimental validation of observational methods. I hope this framework can help guide future work toward a cumulative research tradition in networked experimentation.

Keywords: networks, experiments, design, sampling, randomization, inference, interference

Access to the complete content on Oxford Handbooks Online requires a subscription or purchase. Public users are able to search the site and view the abstracts and keywords for each book and chapter without a subscription.

Please subscribe or login to access full text content.

If you have purchased a print title that contains an access token, please see the token for information about how to register your code.

For questions on access or troubleshooting, please check our FAQs, and if you can''t find the answer there, please contact us.