{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004571444,0.001572161,0.002021051,0.001046069,0.001097311,0.0035502,0.002514797,0.002642456,0.002182744],"category_scores_gemma":[0.007301703,0.000924934,0.001478648,0.00149394,0.002668363,0.004756753,0.00181352,0.001617452,0.0003718543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002499795,"about_ca_system_score_gemma":0.001515934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002902637,"about_ca_topic_score_gemma":0.001893183,"domain_scores_codex":[0.995962,0.002553268,0.0001245124,0.0003350659,0.0006197141,0.000405381],"domain_scores_gemma":[0.9975626,0.001810319,0.0002159328,0.0001142767,0.0001684108,0.0001284568],"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.00009110961,0.00005221328,0.0003020886,0.00006393249,0.000060476,0.0003083761,0.0001934271,0.7007864,0.001031482,0.2865727,0.0006021188,0.009935658],"study_design_scores_gemma":[0.00002099924,0.00003357649,0.00004168865,0.000007590069,0.00001513372,0.00004987366,0.00003589385,0.9161999,0.0002758853,0.08272751,0.0005765505,0.00001537318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02680643,0.0005366934,0.9630446,0.0004136963,0.00006110215,0.00008453288,0.00003271579,0.00007153723,0.008948693],"genre_scores_gemma":[0.9198883,0.000992943,0.07361298,0.0001329192,0.000113232,0.0002228556,0.00003240581,0.00003970269,0.004964663],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004571444,"threshold_uncertainty_score":0.02417636,"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."}}