An Experiment on Network Density and Sequential Learning

September 05, 2019 ยท Declared Dead ยท ๐Ÿ› ACM Conference on Economics and Computation

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Krishna Dasaratha, Kevin He arXiv ID 1909.02220 Category econ.TH Cross-listed cs.SI, econ.GN Citations 13 Venue ACM Conference on Economics and Computation Last Checked 1 month ago
Abstract
We conduct a sequential social-learning experiment where subjects each guess a hidden state based on private signals and the guesses of a subset of their predecessors. A network determines the observable predecessors, and we compare subjects' accuracy on sparse and dense networks. Accuracy gains from social learning are twice as large on sparse networks compared to dense networks. Models of naive inference where agents ignore correlation between observations predict this comparative static in network density, while the finding is difficult to reconcile with rational-learning models.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” econ.TH

R.I.P. ๐Ÿ‘ป Ghosted

Interactive coin offerings

Jason Teutsch, Vitalik Buterin, Christopher Brown

econ.TH ๐Ÿ› arXiv ๐Ÿ“š 39 cites 6 years ago

Died the same way โ€” ๐Ÿ‘ป Ghosted