{"id":"W2135474067","doi":"10.1109/tsp.2010.2048320","title":"Cooperative Resource Allocation Games Under Spectral Mask and Total Power Constraints","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Resource allocation; Bargaining problem; Mathematical optimization; Computer science; Nash equilibrium; Game theory; Resource management (computing); Bandwidth (computing); Multiplexing; Spectral efficiency; Computational complexity theory; Distributed computing; Mathematics; Algorithm; Computer network; Mathematical economics; Telecommunications","routes":{"ca_aff":true,"ca_fund":true,"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.002676104,0.001645838,0.001736953,0.0006374068,0.000763337,0.001697569,0.001553487,0.00190533,0.001544693],"category_scores_gemma":[0.005821574,0.0006240401,0.0006678438,0.0009378766,0.002124982,0.002179176,0.001914885,0.001292324,0.0002194749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001744695,"about_ca_system_score_gemma":0.001531269,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002982628,"about_ca_topic_score_gemma":0.002219085,"domain_scores_codex":[0.9973196,0.001561856,0.00008437182,0.0002593999,0.0004108468,0.0003637867],"domain_scores_gemma":[0.9961863,0.003012995,0.0002892463,0.0001043447,0.0002325159,0.0001745289],"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.0001334465,0.000051649,0.0002521446,0.00007957597,0.00004229712,0.0002342516,0.000163701,0.8888627,0.001614216,0.1005067,0.0004947223,0.007564628],"study_design_scores_gemma":[0.00002621166,0.00003834134,0.00005420352,0.000005223478,0.000008698639,0.00003108698,0.00003711336,0.9720536,0.0002699759,0.02717896,0.0002887902,0.000007757248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04533779,0.0002050567,0.9464927,0.0002870463,0.00003634155,0.0001236994,0.0000489224,0.00004770829,0.007420555],"genre_scores_gemma":[0.929351,0.0003078035,0.06528307,0.0001158806,0.00004039968,0.000437176,0.0000444748,0.00002607845,0.004394045],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002982628,"threshold_uncertainty_score":0.01415277,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01060911200360533,"score_gpt":0.2331337309123653,"score_spread":0.2225246189087599,"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."}}