{"id":"W2751369415","doi":"10.1109/lwc.2017.2747543","title":"A Hierarchical Learning Solution for Anti-Jamming Stackelberg Game With Discrete Power Strategies","year":2017,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University; McMaster University","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Stackelberg competition; Computer science; Jamming; Mathematical optimization; Convergence (economics); Game theory; Bounded rationality; Nash equilibrium; Power (physics); Bounded function; Mathematics; Artificial intelligence; Mathematical economics","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.0008883787,0.0009996245,0.001017697,0.000579057,0.0005759334,0.001125982,0.001610454,0.001399649,0.003433694],"category_scores_gemma":[0.002193805,0.000377515,0.0005426342,0.0005347984,0.0009101683,0.001169497,0.001285328,0.001207136,0.0004218105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001230096,"about_ca_system_score_gemma":0.002101401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0078292,"about_ca_topic_score_gemma":0.005317476,"domain_scores_codex":[0.9994211,0.0001544113,0.00002664851,0.0001251701,0.0001423344,0.0001302115],"domain_scores_gemma":[0.9993161,0.0003481626,0.0001100544,0.00002987527,0.000125578,0.00007022689],"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.00004608444,0.0000511625,0.0003039346,0.00006759487,0.00002425681,0.00007682715,0.0001046899,0.9298092,0.001113249,0.0507623,0.0009738838,0.01666688],"study_design_scores_gemma":[0.000009718435,0.00002508786,0.00003219032,0.000002901174,0.000003796702,0.00000778873,0.00001089059,0.9923078,0.00009116162,0.007289592,0.0002153225,0.000003822825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02022548,0.0001295968,0.9725366,0.0002068985,0.0000292,0.00007091917,0.0000475377,0.0001200272,0.006633771],"genre_scores_gemma":[0.8845373,0.0002684685,0.1081009,0.0001393097,0.00004437132,0.0002311174,0.00007850171,0.00002901983,0.006571006],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0078292,"threshold_uncertainty_score":0.01556724,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02682436211103208,"score_gpt":0.2874370576465063,"score_spread":0.2606126955354742,"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."}}