{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000104855,0.0001591886,0.0001236135,0.0001104373,0.0002428291,0.0001067214,0.0001002098,0.0000927931,0.0002520996],"category_scores_gemma":[0.000002015593,0.0001587223,0.0000360687,0.0001760458,0.0001953457,0.0002584968,0.000001209832,0.0005269994,0.00001669926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002759025,"about_ca_system_score_gemma":0.00004598021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000279743,"about_ca_topic_score_gemma":0.00002184879,"domain_scores_codex":[0.9993202,0.00002265428,0.0001859819,0.0001710572,0.0001139467,0.000186147],"domain_scores_gemma":[0.9995872,0.00006312417,0.00002499894,0.000178721,0.00005431748,0.00009164535],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00008734455,0.000344664,0.00002271139,0.00009644611,0.0001438903,0.000006996835,0.003932402,0.1834076,0.5326538,0.000931933,0.0002391774,0.278133],"study_design_scores_gemma":[0.002699738,0.0003828654,0.002226173,0.0004215448,0.0001969499,0.000442339,0.00422141,0.4877664,0.494261,0.0008826104,0.004640508,0.001858458],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3399614,0.000171127,0.653981,0.000254234,0.0001273534,0.0001312934,0.00001524189,0.0002398449,0.005118504],"genre_scores_gemma":[0.9977522,0.00001784809,0.001897564,0.00007068273,0.00003156219,0.00002015975,0.000003361517,0.00002995334,0.0001766297],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6577908,"threshold_uncertainty_score":0.6472506,"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."}}