{"id":"W1999429894","doi":"10.1117/12.482435","title":"<title>Competitive game theoretic optimal routing in optical networks</title>","year":2002,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer network; Provisioning; Service provider; Computer science; Game theory; Profit (economics); Bandwidth (computing); The Internet; Bandwidth allocation; Telecommunications service; Profitability index; Differentiated services; Telecommunications; Quality of service; Service (business); Business; Microeconomics; Economics; World Wide Web; Marketing; Finance","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002359204,0.0002775631,0.000340407,0.00009460009,0.00003183205,0.00005722951,0.0006073004,0.0002470899,0.0001418191],"category_scores_gemma":[0.0003575619,0.000248593,0.0002893138,0.0003493333,0.000275249,0.0002223196,0.0001416766,0.0004607845,0.00003123121],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001701744,"about_ca_system_score_gemma":0.000006396398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.666138e-7,"about_ca_topic_score_gemma":5.40952e-8,"domain_scores_codex":[0.9984363,1.966623e-8,0.0004711412,0.0002754316,0.0003564231,0.0004606737],"domain_scores_gemma":[0.9993015,0.000157964,0.00009544331,0.00006521151,0.0002989015,0.0000809642],"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.00001193983,0.00004436345,0.00003566549,0.0001172795,0.0001181555,4.933761e-7,0.00005570954,0.007785401,0.0144399,0.9722155,0.003552178,0.001623437],"study_design_scores_gemma":[0.0005717715,0.0001330598,0.0001765841,0.000371335,0.00007029471,0.00001847948,0.0002955315,0.9760436,0.005157272,0.003301799,0.01337009,0.0004901416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8727103,0.0005365126,0.001255417,0.0006387135,0.0004362053,0.0004067374,0.00001641321,0.0004531525,0.1235465],"genre_scores_gemma":[0.8450998,0.0006150928,0.1531175,0.0000429204,0.0004770943,0.00008125853,0.000004906206,0.0001066169,0.0004548352],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9689137,"threshold_uncertainty_score":0.9999966,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008182895876926935,"score_gpt":0.2066802644446529,"score_spread":0.1984973685677259,"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."}}