{"id":"W2964297291","doi":"10.1109/tvt.2012.2204076","title":"Power Allocation and Pricing in Multiuser Relay Networks Using Stackelberg and Bargaining Games","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Stackelberg competition; Computer science; Computer network; Relay channel; Game theory; Mathematical optimization; Bargaining problem; Transmitter power output; Power (physics); Microeconomics; Economics; Mathematics; Transmitter","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.0003259475,0.000133185,0.0001523845,0.0003969962,0.0002311341,0.00004404867,0.0002191416,0.0001777931,0.000005121778],"category_scores_gemma":[0.00001203827,0.0001355589,0.0000208113,0.0007004854,0.00009490032,0.0004148543,0.00001855246,0.0004252832,0.000002140624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006463668,"about_ca_system_score_gemma":0.0000157335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006682054,"about_ca_topic_score_gemma":0.00003036669,"domain_scores_codex":[0.9990762,0.0001035628,0.0002031931,0.0002547996,0.00007939834,0.0002828051],"domain_scores_gemma":[0.9993393,0.00009011793,0.00005548183,0.0004093692,0.00004861897,0.00005711736],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003473404,0.0005897582,0.01422795,0.00002386086,0.0001434207,0.00001807697,0.006793058,0.1970521,0.03585668,0.05523435,0.0000238331,0.6900021],"study_design_scores_gemma":[0.0005633278,0.00007158248,0.002674764,0.0001091534,0.00001199763,0.00007128688,0.0002302909,0.9879,0.00714512,0.000131789,0.0008132795,0.0002774245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3223079,0.001394901,0.6755067,0.0004331276,0.00009184708,0.0001128994,1.577003e-7,0.0001133052,0.00003919863],"genre_scores_gemma":[0.9724604,0.0008767905,0.02645362,0.0001522562,0.000008437783,0.00002164461,3.116466e-7,0.00001145903,0.00001505724],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7908478,"threshold_uncertainty_score":0.552793,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02073356214646539,"score_gpt":0.2634734184447827,"score_spread":0.2427398562983173,"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."}}