Search arXivSearch

arXiv · 2210.02504

Bikeability and the induced demand for cycling

Abstract

To what extent is the volume of urban bicycle traffic affected by the provision of bicycle infrastructure? In this study, we exploit a large dataset of observed bicycle trajectories in combination with a fine-grained representation of the Copenhagen bicycle-relevant network. We apply a novel model for bicyclists' choice of route from origin to destination that takes the complete network into account. This enables us to determine bicyclists' preferences for a range of infrastructure and land-use types. We use the estimated preferences to compute a subjective cost of bicycle travel, which we correlate with the number of bicycle trips across a large number of origin-destination pairs. Simulations suggest that the extensive Copenhagen bicycle lane network has caused the number of bicycle trips and the bicycle kilometers traveled to increase by 60% and 90%, respectively, compared with a counterfactual without the bicycle lane network. This translates into an annual benefit of EUR 0.4M per km of bicycle lane owing to changes in subjective travel cost, health, and accidents. Our results thus strongly support the provision of bicycle infrastructure.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mogens Fosgerau, Miroslawa Lukawska, Mads Paulsen, Thomas Kjær Rasmussen. 2022-12-05. Bikeability and the induced demand for cycling. https://doi.org/10.1073/pnas.2220515120

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Testing for Monotone Equilibrium Strategies in Games of Incomplete Information

This paper develops a unified framework for testing monotonicity of Bayesian Nash equilibrium strategies in unobserved types in games of incomplete information. We show that, under symmetric independent private types, monotonicity of differentiable equilibrium strategies is equivalent to monotonicity of a quasi-inverse strategy identified from observed actions. This allows the problem to be reformulated as testing a countable set of moment inequalities involving unconditional expectations. We propose a Cramer-von Mises-type statistic with bootstrap critical values. The method accommodates covariates and game heterogeneity. Monte Carlo simulations demonstrate finite-sample performance, and an application to procurement auctions illustrates cartel detection.

econ.EM

Ordinal Distributional Change and Conservative Transition Benchmarks: Measurement, Identification, and Inference

Repeated cross-sections reveal changes in ordinal distributions but not the transitions producing them. I axiomatically characterize a threshold-weighted probability metric for ordinal change from threshold-crossing principles. For any threshold-additive ordinal geometry, the discrepancy coincides with the Wasserstein--1 distance induced by that ground metric and measures minimum displacement; its optimizing plans define conservative transition benchmarks. With missing outcomes, I derive sharp identified sets for the discrepancy and endpoint-conditioned benchmark plans. I develop finite-sample-valid projection inference using randomized Monte Carlo calibration and global search with an almost-sure convergence guarantee. Applied to Arab Barometer data, the framework documents a robust shift toward broader and more regular remittance receipt in Lebanon. The discrepancy interval remains well separated from zero after allowing for item nonresponse and sampling uncertainty, while benchmark bounds provide strong numerical evidence that least-displacement restructuring excludes movement toward less frequent receipt and requires reassignment from nonreceipt to recurrent receipt.

econ.EM

A Stochastic Nested Fixed Point Algorithm for Large-Scale BLP Estimation

We develop a stochastic nested fixed point (SNFP) estimator for random coefficients logit demand models that updates model parameters using stochastic gradients and performs demand inversion one market at a time. Relative to the conventional nested fixed point (NFP) estimator, SNFP substantially reduces memory requirements and computational cost, making estimation feasible in very large datasets. We establish the large-$T$ (number of markets) asymptotic properties of the estimator under regularity conditions. We also characterize the effect of sharing one block of simulation draws across markets and show how to correct for it. Monte Carlo simulations show that the SNFP estimator achieves statistical accuracy comparable to the NFP estimator, and in our benchmark a single online pass estimates a model with 100 million markets in about 5.5 hours. An empirical application using scanner data further demonstrates the practical advantages of SNFP for large-scale demand estimation.

econ.EM