{"id":"W1982597307","doi":"10.1109/twc.2013.092013.120862","title":"Opportunistic Spectrum Access with Spatial Reuse: Graphical Game and Uncoupled Learning Solutions","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":97,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Cognitive radio; Potential game; Nash equilibrium; Game theory; Channel (broadcasting); Reuse; Computer network; Scheduling (production processes); Mathematical optimization; Channel allocation schemes; Information exchange; Interference (communication); Wireless; Telecommunications; Mathematics; Mathematical economics","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.0009252821,0.0009290092,0.000846266,0.0004966647,0.0004115749,0.001139134,0.001626301,0.001198804,0.001467784],"category_scores_gemma":[0.003529249,0.0003710908,0.0006538187,0.0005241138,0.001526404,0.00158181,0.001873283,0.0009904711,0.0001877421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001163876,"about_ca_system_score_gemma":0.000975355,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002597036,"about_ca_topic_score_gemma":0.002327082,"domain_scores_codex":[0.9990273,0.0005011517,0.00002965683,0.0001424105,0.0001602591,0.0001391957],"domain_scores_gemma":[0.9985332,0.0009263673,0.0001935973,0.0001216365,0.00009614215,0.0001290471],"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.0001011824,0.00007599069,0.0003791725,0.0000512353,0.00004383482,0.0001135623,0.0001007262,0.885466,0.001068242,0.0977269,0.0005460946,0.01432699],"study_design_scores_gemma":[0.00002206482,0.00002610497,0.0000530905,0.00000379742,0.000005557639,0.00002145688,0.00001355601,0.9631105,0.0001542372,0.03628193,0.0003016629,0.000006018148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0597266,0.0001762406,0.9312701,0.000412016,0.00003021033,0.00008359488,0.00005739549,0.0001201052,0.008123728],"genre_scores_gemma":[0.9395829,0.0001498056,0.0563844,0.00009650306,0.00001871268,0.0001288851,0.00003874851,0.00002205427,0.003577853],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002597036,"threshold_uncertainty_score":0.008444488,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03196376893613621,"score_gpt":0.2576382620078482,"score_spread":0.225674493071712,"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."}}