{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004271779,0.0001274061,0.0002199945,0.0001262686,0.0001916659,0.0002074799,0.0005714403,0.00010102,0.00006645022],"category_scores_gemma":[0.000396476,0.0001076508,0.00009216426,0.000564194,0.00009386661,0.0002767693,0.00008747644,0.0001783925,0.00004480532],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003944079,"about_ca_system_score_gemma":0.00004982338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006494393,"about_ca_topic_score_gemma":0.0003362823,"domain_scores_codex":[0.9981402,0.00009078534,0.0005989326,0.0003968038,0.0003314767,0.0004417776],"domain_scores_gemma":[0.9969862,0.002167205,0.0001498351,0.0004394648,0.0001558054,0.0001014937],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001283478,0.0003466116,0.005021382,0.000004550186,0.000026982,0.00001285446,0.001774982,0.01569638,0.0009132191,0.461652,0.005826085,0.5085967],"study_design_scores_gemma":[0.001096169,0.00006837284,0.03228515,0.00001195841,0.00001299175,0.000008369254,0.004058849,0.5316511,0.001172341,0.4099798,0.01925885,0.000396057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.38578,0.00001859174,0.6106628,0.000273269,0.0001842757,0.000286,0.00001746407,0.00004463698,0.00273296],"genre_scores_gemma":[0.9745542,0.000001569192,0.02432923,0.0002158749,0.0003535953,0.00003387131,0.00001180768,0.00001160055,0.0004883026],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5887741,"threshold_uncertainty_score":0.4389872,"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."}}