{"id":"W2951951756","doi":"10.1002/net.20074","title":"An approximation algorithm for Stackelberg network pricing","year":2005,"lang":"en","type":"article","venue":"Networks","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":84,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stackelberg competition; Toll; Relaxation (psychology); Linear programming relaxation; Set (abstract data type); Approximation algorithm; Computer science; Constraint (computer-aided design); Flow network; Algorithm; Combinatorics; Mathematics; Mathematical optimization; Linear programming; Mathematical economics","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005586793,0.00006511807,0.00007946973,0.0000242233,0.0005302889,0.00007559093,0.00009313862,0.0001104343,0.00004050456],"category_scores_gemma":[0.00001254697,0.0000701996,0.00003118129,0.0002121346,0.00003291339,0.0003424009,0.000001633035,0.00007008598,0.000003898533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004271124,"about_ca_system_score_gemma":0.0000391773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007054715,"about_ca_topic_score_gemma":0.0006087623,"domain_scores_codex":[0.9992139,0.00006072809,0.0001575097,0.0001509281,0.0001446759,0.0002722832],"domain_scores_gemma":[0.9995839,0.00008462887,0.00007859165,0.00008332195,0.00008960664,0.00007996707],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004755454,0.00001579961,0.0006423025,0.000001111387,0.000003718482,9.779611e-8,0.00196886,0.7272051,3.570216e-7,0.004567563,0.002197582,0.2633928],"study_design_scores_gemma":[0.0001981945,0.00002439652,0.001156029,0.00001232638,0.00001234844,9.397627e-8,0.0003544132,0.9332024,0.000002306436,0.0002997573,0.06463791,0.00009976031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001572369,0.0001225784,0.9941365,0.0002868441,0.0003100516,0.0002876821,0.000003141051,0.0001825773,0.003098331],"genre_scores_gemma":[0.5610772,0.00009597276,0.432053,0.000479831,0.004973244,0.00005907451,0.0003882313,0.00002239609,0.0008510597],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5620834,"threshold_uncertainty_score":0.4078607,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01407393180372267,"score_gpt":0.2909614343161206,"score_spread":0.276887502512398,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}