{"id":"W2155215189","doi":"10.1109/tcomm.2008.060641","title":"A Nash game approach for OSNR optimization with capacity constraint in optical links","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Network Technologies","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Nash equilibrium; Wavelength-division multiplexing; Computer science; Convergence (economics); Mathematical optimization; Constraint (computer-aided design); Multiplexing; Mathematics; Telecommunications; Wavelength; Optics; Physics","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.00183012,0.001309861,0.00130696,0.0007037702,0.0006908907,0.00131212,0.001618488,0.001439887,0.002944781],"category_scores_gemma":[0.003806989,0.0006393023,0.0007940567,0.0006249517,0.002152278,0.002111871,0.001377287,0.00169295,0.000307955],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001759824,"about_ca_system_score_gemma":0.002132289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008602615,"about_ca_topic_score_gemma":0.006300005,"domain_scores_codex":[0.9989838,0.0005864828,0.0000249411,0.00009626171,0.0002052851,0.0001032206],"domain_scores_gemma":[0.9985707,0.001090134,0.0000830905,0.00003719121,0.0001583554,0.00006061108],"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.00003257168,0.00002848499,0.0001154781,0.00004379166,0.00001612912,0.00006520659,0.00006564886,0.8999893,0.0005989419,0.09357693,0.000308796,0.00515868],"study_design_scores_gemma":[0.000009237217,0.00001725223,0.00001750425,0.000004243937,0.000003104285,0.000008202393,0.000008615773,0.9847622,0.0001169892,0.01467369,0.000374004,0.000004980363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009466725,0.0002007099,0.9835956,0.0001837461,0.00004817943,0.00007626368,0.00002375589,0.00003652791,0.006368431],"genre_scores_gemma":[0.6476868,0.0008498929,0.3341305,0.0002271534,0.0001404301,0.0005670331,0.00006671951,0.00009246089,0.01623905],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008602615,"threshold_uncertainty_score":0.0171051,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04522916850898601,"score_gpt":0.2304290169166437,"score_spread":0.1851998484076577,"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."}}