MétaCan
Menu
Back to cohort
Record W3121647810

Cost Recovery from Congestion Tolls with Long-run Uncertainty

2013· article· en· W3121647810 on OpenAlexaff
Robin Lindsey

Bibliographic record

VenueHAL (Le Centre pour la Communication Scientifique Directe) · 2013
Typearticle
Languageen
FieldSocial Sciences
TopicTransportation Planning and Optimization
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsEconomics
DOInot available

Abstract

fetched live from OpenAlex

According to the seminal Cost Recovery Theorem the revenues from congestion tolls pay for the capacity costs of an optimal-sized facility if capacity is perfectly divisible, and if user costs and capacity costs have constant scale economies. This paper extends the Theorem to long-run uncertainty about investment costs, user costs, and demand. It proves that if constant scale economies hold at all times and in all states, and if the toll can be varied freely over time and by state, then expected discounted toll revenues cover expected discounted investment costs over a facility's lifetime. If the marginal cost of investment is constant and investment is reversible, then expected cost recovery is also achieved for each investment. Cost recovery is quite sensitive to estimated initial demand, and moderately sensitive to the estimated growth rate of demand. Natural variability in demand can result in substantial surpluses or deficits over a facility's lifetime.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.015
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.004
Threshold uncertainty score0.017

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.015
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.002
Scholarly communication0.0020.004
Open science0.0020.002
Research integrity0.0010.003
Insufficient payload (model declined to judge)0.0030.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.015
GPT teacher head0.236
Teacher spread0.221 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2013
Admission routes1
Has abstractyes

Explore more

Same venueHAL (Le Centre pour la Communication Scientifique Directe)Same topicTransportation Planning and OptimizationFrench-language works237,207