MétaCan
Menu
Back to cohort
Record W2474007778 · doi:10.1287/trsc.2015.0628

Network Pricing of Congestion-Free Networks: The Elastic and Linear Demand Case

2016· article· en· W2474007778 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueTransportation Science · 2016
Typearticle
Languageen
FieldSocial Sciences
TopicTransportation Planning and Optimization
Canadian institutionsUniversité de MontréalPolytechnique Montréal
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsTollPrice elasticity of demandMathematical optimizationFlow networkQuadratic equationPath (computing)Elasticity (physics)RevenueComputer scienceMathematicsEconomicsMicroeconomicsComputer network

Abstract

fetched live from OpenAlex

In this work, we address the problem of maximizing the revenue raised from tolls set on a multicommodity transportation network, taking into account that users are assigned to cheapest paths, and that demand is a linearly decreasing function of total path cost (initial cost of carrying the products plus toll). We propose for its numerical solution three mixed quadratic formulations, either in arc or path flow space. Similar to what was achieved in the fixed demand case, we analyze the structure and properties of the problem, including its theoretical complexity. On the computational side, we analyze the sensitivity of central processing unit time with respect to two key parameters, namely, demand elasticity and percentage of toll arcs.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Observational · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.684
Threshold uncertainty score0.623

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0010.001
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.019
GPT teacher head0.280
Teacher spread0.261 · 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