EconPapers    
Economics at your fingertips  
 

Social network and temporal discounting

Ronald S. Burt

Network Science, 2017, vol. 5, issue 4, 411-440

Abstract: For reasons of social influence and social logistics, people in closed networks are expected to experience time compression: The more closed a person's network, the steeper the person's discount function, and the more narrow the expected time horizon within which the person deliberates events and behavior. Consistent with the hypothesis, data on managers at the top of three organizations show network closure associated with a social life compressed into daily contact with colleagues. Further, language in closed networks is predominantly about current activities, ignoring the future. Further still, discount functions employed by executive MBA students show more severe discounting by students in more closed networks. Inattention to the future can be argued to impair achievement, however, I find no evidence across the managers of daily contact diminishing the achievement associated with network advantage. I close with comments on replication and extrapolation to language more generally, within-person variation, and select cognitive patterns (closure bias, end of history, and felt status loss).

Date: 2017
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://www.cambridge.org/core/product/identifier/ ... type/journal_article link to article abstract page (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cup:netsci:v:5:y:2017:i:04:p:411-440_00

Access Statistics for this article

More articles in Network Science from Cambridge University Press Cambridge University Press, UPH, Shaftesbury Road, Cambridge CB2 8BS UK.
Bibliographic data for series maintained by Kirk Stebbing ().

 
Page updated 2025-03-19
Handle: RePEc:cup:netsci:v:5:y:2017:i:04:p:411-440_00