{"id":"W2128002369","doi":"10.1109/glocom.2006.149","title":"GEN02-1: Hierarchical Iterative Algorithm for a Coupled Constrained OSNR Nash Game","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Optical Network Technologies","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Nash equilibrium; Game theory; Mathematical optimization; Computer science; Iterative method; Best response; Constraint (computer-aided design); Channel (broadcasting); Normal-form game; Algorithm; Mathematics; Repeated game; Mathematical 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.001730541,0.001053903,0.001190376,0.0007232946,0.0006885372,0.0009841889,0.002031545,0.001420356,0.005958035],"category_scores_gemma":[0.004115206,0.0005696043,0.0006582211,0.0005707429,0.001070538,0.00112972,0.002538604,0.001274251,0.001017837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00164291,"about_ca_system_score_gemma":0.002776848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006896793,"about_ca_topic_score_gemma":0.009111252,"domain_scores_codex":[0.9991678,0.0003291706,0.00003010822,0.0001186575,0.0002128541,0.000141425],"domain_scores_gemma":[0.9987261,0.0008164792,0.00009020387,0.00009087156,0.0001999307,0.0000763959],"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.0001069294,0.00006855023,0.0005655926,0.00007303547,0.0000299107,0.00008715563,0.0001493154,0.8928445,0.001337054,0.05786783,0.001956953,0.04491318],"study_design_scores_gemma":[0.00001810083,0.00001541403,0.00002099069,0.000004222969,0.000002577351,0.000008230912,0.000008756015,0.9927834,0.0001789954,0.006518318,0.00043733,0.000003629335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006578547,0.00004345016,0.9873612,0.00008925918,0.00001510103,0.0001094212,0.00003364636,0.0002774039,0.005491932],"genre_scores_gemma":[0.2991636,0.00008835901,0.694935,0.0001912007,0.00002617708,0.0005795956,0.0001589912,0.0001352435,0.00472185],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006896793,"threshold_uncertainty_score":0.01993155,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006190928254146906,"score_gpt":0.2106949013831338,"score_spread":0.2045039731289869,"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."}}