{"id":"W2007607403","doi":"10.1109/icassp.2010.5496080","title":"Pareto-optimal solutions of Nash bargaining resource allocation games with spectral mask and total power constraints","year":2010,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematical optimization; Bottleneck; Resource allocation; Computer science; Bandwidth (computing); Nash equilibrium; Pareto optimal; Bargaining problem; Pareto principle; Game theory; Computational complexity theory; Multi-objective optimization; Mathematical economics; Mathematics; Algorithm; 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.003036303,0.001800994,0.001560483,0.001530203,0.0009257871,0.002387373,0.001418951,0.001740585,0.002836778],"category_scores_gemma":[0.006073528,0.0008703152,0.0008806213,0.001427897,0.002280033,0.001613057,0.001986793,0.001295239,0.0005303088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002151914,"about_ca_system_score_gemma":0.0027082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003758701,"about_ca_topic_score_gemma":0.003234266,"domain_scores_codex":[0.9982358,0.001018532,0.00005566832,0.0001366987,0.0002373245,0.0003159753],"domain_scores_gemma":[0.997769,0.001633691,0.0002107389,0.00006324772,0.0001985856,0.0001246327],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001190532,0.00006960211,0.0002656019,0.00008640431,0.00005123873,0.00009198226,0.000165606,0.7915905,0.0007042887,0.1957698,0.001300078,0.009785883],"study_design_scores_gemma":[0.00004197253,0.00003911773,0.00009070458,0.00002036717,0.00001125463,0.00002013775,0.00007098955,0.9099329,0.0003071597,0.08882339,0.00062818,0.00001381663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07241533,0.0004051703,0.8974146,0.0005058859,0.00004873554,0.0001781049,0.0001602598,0.00007275776,0.02879914],"genre_scores_gemma":[0.8382853,0.0007266009,0.1507095,0.0001644131,0.00004419901,0.0005424408,0.0001416689,0.00006173034,0.009324229],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003758701,"threshold_uncertainty_score":0.01605773,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03560089906664556,"score_gpt":0.3068002601224034,"score_spread":0.2711993610557579,"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."}}