{"id":"W2012502281","doi":"10.1016/j.comcom.2008.01.049","title":"A joint selfish routing and channel assignment game in wireless mesh networks","year":2008,"lang":"en","type":"article","venue":"Computer Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Nash equilibrium; Routing (electronic design automation); Mathematical optimization; Wireless mesh network; Computer network; Channel (broadcasting); Best response; Game theory; Heuristic; Distributed computing; Wireless; Wireless network; Mathematical economics; Telecommunications; 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":[],"consensus_categories":[],"category_scores_codex":[0.0005156628,0.0001968437,0.0002808541,0.0001693988,0.0006103365,0.0001636765,0.002368336,0.00007591236,0.000003972596],"category_scores_gemma":[0.00001713447,0.0002097972,0.00005856538,0.0006965653,0.0001932856,0.0004097862,0.003834505,0.0004949017,0.00001011685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001046461,"about_ca_system_score_gemma":0.00006595732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001709396,"about_ca_topic_score_gemma":0.00008083864,"domain_scores_codex":[0.9981605,0.0004993102,0.0004711644,0.0003687392,0.000166724,0.000333521],"domain_scores_gemma":[0.9966237,0.0003152906,0.0001458853,0.002660361,0.0001241733,0.0001306215],"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.000009018496,0.00115241,0.01042053,0.00002255267,0.0001237422,0.00004191109,0.02754951,0.005802484,0.0002862823,0.6213069,0.005946453,0.3273382],"study_design_scores_gemma":[0.0004163662,0.00003306233,0.02462257,0.00009283876,0.000002866971,0.00005761432,0.0000252766,0.9726041,0.00001745347,0.0003035151,0.001587457,0.000236863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01198172,0.001119371,0.9801368,0.004879563,0.0001579592,0.0003145249,7.509453e-7,0.0002313634,0.001177935],"genre_scores_gemma":[0.9530384,0.007751316,0.0380463,0.0009550487,0.00005755539,0.00007447379,0.00001144728,0.0000137367,0.0000517428],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9668016,"threshold_uncertainty_score":0.8555283,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07761816825018782,"score_gpt":0.2696275960658492,"score_spread":0.1920094278156614,"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."}}