{"id":"W2901302572","doi":"10.1109/lcomm.2018.2882387","title":"Contract-Based Incentive Mechanism for Cooperative NOMA Systems","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science; Noma; Base station; Incentive; Adverse selection; Contract theory; Channel state information; Computer network; Wireless; Selection (genetic algorithm); Mechanism design; Set (abstract data type); Channel (broadcasting); Process (computing); Incentive compatibility; Mathematical optimization; Business; Telecommunications; Telecommunications link; Microeconomics; Finance; Artificial intelligence","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.0001265885,0.0001851338,0.0002103655,0.000147023,0.0004063123,0.00006600186,0.001626009,0.00009947639,0.000005375521],"category_scores_gemma":[0.00009027277,0.0002026399,0.00005785915,0.0002699281,0.0004727292,0.000204329,0.0001031561,0.0002453542,0.00005479192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000188882,"about_ca_system_score_gemma":0.00002195337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002237862,"about_ca_topic_score_gemma":0.00004605559,"domain_scores_codex":[0.9991075,0.00007915492,0.0003142791,0.0001632483,0.00008266772,0.0002530978],"domain_scores_gemma":[0.9964603,0.0005055272,0.00009322486,0.002571059,0.0003293384,0.00004059294],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002755887,0.0001445065,0.0000974595,0.0000787173,0.0002493998,5.83574e-7,0.0008246941,0.04019023,0.539768,0.4030315,0.008515892,0.007071416],"study_design_scores_gemma":[0.00101196,0.00008429835,0.00004517192,0.0001137479,0.00002797337,0.000001632687,0.0003925599,0.7629834,0.2054516,0.001320138,0.02805255,0.0005149897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0158517,0.0004461806,0.9767428,0.003543707,0.0004026794,0.0008257271,0.0001045075,0.001296432,0.0007862796],"genre_scores_gemma":[0.9432455,0.0001499004,0.05478252,0.000679536,0.00004593875,0.0009662742,0.00006727625,0.00004930084,0.00001379827],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9273937,"threshold_uncertainty_score":0.8263415,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02983879573168562,"score_gpt":0.2722240139433533,"score_spread":0.2423852182116677,"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."}}