Hostname: page-component-74656f9884-rdgjk Total loading time: 0 Render date: 2026-11-09T03:57:18.989Z Has data issue: false hasContentIssue false

Revised-Path Dependence

Published online by Cambridge University Press:  04 January 2017

Jenna Bednar*
Affiliation:
Department of Political Science, University of Michigan, Ann Arbor, MI 48104, and Santa Fe Institute, Santa Fe, NM 87501
Scott E. Page
Affiliation:
Center for the Study of Complex Systems, University of Michigan, Ann Arbor, MI 48104, and Santa Fe Institute, Santa Fe, NM 87501
Jameson L. Toole
Affiliation:
M.I.T. Systems Engineering Division, Cambridge, MA 02139
*
e-mail: jbednar@umich.edu (corresponding author)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this article, we define a class of revised path—dependent processes and characterize their basic properties. A process exhibits revised-path dependence if the current outcome can revise the value of a past outcome. A revision could be a change to that outcome or a reinterpretation. We first define a revised path—dependent process called the accumulation process: in each period, a randomly chosen past outcome is changed to match the current outcome and show that it converges to identical outcomes. We then construct a general class of models that includes the Bernoulli process, the Polya process, and the accumulation process as special cases. For this general class, we show that, apart from knife-edge cases, all processes converge either to homogeneous equilibria or to an equal probability distribution over types. We also show that if random draws advantage one outcome over the other, then the process has a unique equilibrium.

Information

Type
Symposium on Path Dependence
Copyright
Copyright © The Author 2012. Published by Oxford University Press on behalf of the Society for Political Methodology