{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002315561,0.0005694304,0.0009566069,0.0004650508,0.000675962,0.001455312,0.001680007,0.001618184,0.001923105],"category_scores_gemma":[0.005937787,0.0004180191,0.0004393424,0.0005198947,0.001704223,0.002175324,0.001486922,0.001015913,0.0001312802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001299293,"about_ca_system_score_gemma":0.001422471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001971928,"about_ca_topic_score_gemma":0.001873886,"domain_scores_codex":[0.9985895,0.0008129611,0.00004341504,0.000137973,0.0002428031,0.0001733059],"domain_scores_gemma":[0.9959848,0.0029959,0.0002884974,0.0001811861,0.0002075022,0.0003420373],"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.0006205235,0.0001755081,0.001000769,0.0001132121,0.00008694355,0.000307325,0.0002929939,0.6424073,0.005347579,0.3338223,0.002355319,0.01347016],"study_design_scores_gemma":[0.00006193074,0.00007537196,0.0001270354,0.000004594217,0.00001327655,0.0000397782,0.00004030425,0.9390228,0.0002536082,0.05992146,0.000427943,0.00001201763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2831593,0.0002191308,0.6966384,0.001731786,0.0001091779,0.000237628,0.0001554687,0.0001050219,0.01764409],"genre_scores_gemma":[0.9760004,0.0001021299,0.01935022,0.00009128521,0.00003444031,0.0001003984,0.00002895542,0.00001393783,0.004278212],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002315561,"threshold_uncertainty_score":0.01224601,"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."}}