{"id":"W2039786295","doi":"10.1007/s00453-007-9018-5","title":"Stackelberg Strategies for Selfish Routing in General Multicommodity Networks","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":53,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Price of anarchy; Stackelberg competition; Routing (electronic design automation); Computer science; Latency (audio); Nash equilibrium; Theory of computation; Mathematical optimization; Upper and lower bounds; Price of stability; Mathematical economics; Mathematics; Topology (electrical circuits); Computer network; Combinatorics; Economics; Telecommunications","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002852979,0.001131344,0.001505187,0.001259322,0.001335068,0.003682067,0.002264331,0.002456762,0.003062537],"category_scores_gemma":[0.009684191,0.0007763226,0.001105642,0.001312202,0.002395155,0.005829185,0.001715215,0.001742856,0.000274242],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002630077,"about_ca_system_score_gemma":0.001835438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00203829,"about_ca_topic_score_gemma":0.00197228,"domain_scores_codex":[0.9988534,0.0005144851,0.00005757925,0.0001536687,0.0001954075,0.0002253601],"domain_scores_gemma":[0.9956254,0.003073602,0.0004988391,0.000204831,0.0002934362,0.0003039593],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000119606,0.00008677547,0.0004742031,0.0001179391,0.00008144093,0.0001197724,0.0003027023,0.18952,0.001250143,0.7943216,0.001842523,0.01176326],"study_design_scores_gemma":[0.00003247549,0.00003140991,0.0001021623,0.00001363815,0.00002241581,0.0000423261,0.00006061986,0.3629117,0.0002986451,0.635686,0.0007821497,0.00001645519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2408903,0.0008692606,0.7328944,0.001865654,0.00008873131,0.0002006425,0.0001592532,0.0001574174,0.02287423],"genre_scores_gemma":[0.933095,0.0008325582,0.05530076,0.0001969128,0.00009532895,0.0002825937,0.00009522619,0.00004978523,0.01005181],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003682067,"threshold_uncertainty_score":0.01908261,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08005567828149378,"score_gpt":0.4028447996557781,"score_spread":0.3227891213742843,"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."}}