{"id":"W2068562910","doi":"10.1002/ett.1533","title":"Optimal distributed interference avoidance: potential game and learning","year":2012,"lang":"en","type":"article","venue":"Transactions on Emerging Telecommunications Technologies","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Potential game; Computer science; Nash equilibrium; Interference (communication); Distributed algorithm; Graph; Mathematical optimization; Channel (broadcasting); Game theory; Selection (genetic algorithm); Wireless network; Wireless; Distributed computing; Theoretical computer science; Artificial intelligence; Mathematics; Computer network; 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.000377548,0.0001861431,0.0001672357,0.0002897696,0.00112743,0.0001387066,0.001636571,0.0001093991,0.00002801134],"category_scores_gemma":[0.00010327,0.0001886118,0.00005860983,0.000846045,0.0002324008,0.0007076481,0.0002237789,0.001085317,0.00003317555],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007227561,"about_ca_system_score_gemma":0.00002310493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005053664,"about_ca_topic_score_gemma":0.000007063194,"domain_scores_codex":[0.9987755,0.0002230345,0.0002725049,0.0002420352,0.0001213539,0.0003655982],"domain_scores_gemma":[0.9981086,0.0001846316,0.0001027163,0.001446634,0.0001001392,0.00005728262],"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.00001030294,0.000385282,0.0003271759,0.00001070542,0.00005970722,5.879182e-7,0.002399188,0.0181253,0.002397149,0.03399299,0.0001499261,0.9421417],"study_design_scores_gemma":[0.001562041,0.0005773728,0.00926213,0.0003754021,0.0001127628,0.0001778841,0.009910016,0.8309727,0.02232119,0.00214957,0.1204287,0.00215027],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02305612,0.002645142,0.9662561,0.005413582,0.00009501328,0.000144874,0.000003263465,0.002053951,0.0003319494],"genre_scores_gemma":[0.8987103,0.007696349,0.09331603,0.00004048718,0.000006510676,0.0001016718,0.000008548764,0.00001116033,0.0001089665],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9399914,"threshold_uncertainty_score":0.8671392,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02426587431752859,"score_gpt":0.2759121245108567,"score_spread":0.2516462501933281,"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."}}