{"id":"W2165893968","doi":"10.1002/wcm.1225","title":"A game‐theoretic approach for relay assignment over distributed wireless networks","year":2011,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"Hong Kong Polytechnic University; Chinese University of Hong Kong; University of Hong Kong","keywords":"Relay; Computer science; Nash equilibrium; Network packet; Computer network; Throughput; Game theory; Regret; Wireless; Fading; Mathematical optimization; Cooperative diversity; Wireless network; Distributed computing; Channel (broadcasting); Telecommunications; Mathematical economics; Power (physics); Mathematics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008203356,0.0002606741,0.0003319486,0.00009607732,0.0009605844,0.0002144894,0.002548638,0.0001133531,0.000006793789],"category_scores_gemma":[0.00001694199,0.0002546993,0.0001077588,0.0005035319,0.0003112096,0.0002453127,0.002375182,0.0003710554,0.000001699465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007720572,"about_ca_system_score_gemma":0.00004998011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001228334,"about_ca_topic_score_gemma":0.000006399694,"domain_scores_codex":[0.9980482,0.0003845094,0.0005152081,0.000485149,0.0001448133,0.0004220806],"domain_scores_gemma":[0.9962023,0.0005214887,0.0002644421,0.002641157,0.0002131,0.0001574808],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000186902,0.0006463857,0.001565604,0.0000537264,0.00009437291,9.068463e-7,0.005963942,0.003598959,0.0002056426,0.5232372,0.0002551153,0.4643595],"study_design_scores_gemma":[0.0005520892,0.000104514,0.0009486264,0.00009026226,0.00001912749,0.00001015523,0.0002071323,0.9934018,0.00007081168,0.0003893164,0.003885166,0.0003209917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02271894,0.00268444,0.9719503,0.0000963729,0.00009424581,0.0008221517,0.000007791963,0.0002500714,0.001375679],"genre_scores_gemma":[0.9053038,0.002879733,0.09109848,0.0001648447,0.00003734875,0.0003523212,0.0001083666,0.0000245987,0.00003048499],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9898028,"threshold_uncertainty_score":0.9999905,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04419872048023298,"score_gpt":0.2773072696827856,"score_spread":0.2331085492025526,"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."}}