{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001936745,0.001052926,0.0009475996,0.0007035912,0.0005515818,0.001357736,0.001735134,0.001305739,0.002680689],"category_scores_gemma":[0.002867112,0.0005027975,0.0007274713,0.0008449918,0.001641048,0.00145242,0.001298156,0.001597059,0.0003743598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001812965,"about_ca_system_score_gemma":0.001349955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003363163,"about_ca_topic_score_gemma":0.002702149,"domain_scores_codex":[0.9985591,0.0008517834,0.00004618934,0.0001654371,0.000262954,0.0001145412],"domain_scores_gemma":[0.9989877,0.0006389497,0.0001008129,0.00007197002,0.0001286464,0.00007181644],"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.00002646729,0.00003493236,0.0001449683,0.00004101376,0.0000294901,0.00007478045,0.00004981823,0.8675315,0.0006610901,0.1220022,0.0007580079,0.008645616],"study_design_scores_gemma":[0.00000795605,0.00001208055,0.00002065948,0.000003367879,0.000003515579,0.0000125645,0.000006617761,0.9728702,0.00008070131,0.02635523,0.0006238073,0.000003364893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0047952,0.0001900302,0.9907416,0.0002290048,0.00003955129,0.00005290166,0.0000227046,0.00004486975,0.00388411],"genre_scores_gemma":[0.7488861,0.000782228,0.2395562,0.0002383071,0.0001690979,0.0004278688,0.00008223319,0.000058065,0.009799859],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003363163,"threshold_uncertainty_score":0.01315403,"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."}}