Optimal city hierarchy: A dynamic programming approach to central place theory

A-Tier
Journal: Journal of Economic Theory
Year: 2014
Volume: 154
Issue: C
Pages: 245-273

Authors (3)

Hsu, Wen-Tai (Academia Sinica) Holmes, Thomas J. (not in RePEc) Morgan, Frank (not in RePEc)

Score contribution per author:

1.341 = (α=2.01 / 3 authors) × 2.0x A-tier

α: calibrated so average coauthorship-adjusted count equals average raw count

Abstract

Central place theory is a key building block of economic geography and an empirically plausible description of city systems. This paper provides a rationale for central place theory via a dynamic programming formulation of the social planner's problem of city hierarchy. We show that there must be one and only one immediate smaller city between two neighboring larger-sized cities in any optimal solution. If the fixed cost of setting up a city is a power function, then the immediate smaller city will be located in the middle, confirming the locational pattern suggested by Christaller [4]. We also show that the solution can be approximated by iterating the mapping defined by the dynamic programming problem. The main characterization results apply to a general hierarchical problem with recursive divisions.

Technical Details

RePEc Handle
repec:eee:jetheo:v:154:y:2014:i:c:p:245-273
Journal Field
Theory
Author Count
3
Added to Database
2026-02-02