{"id":"W1552241428","doi":"10.1007/11839569_12","title":"Interference-Aware Selfish Routing in Multi-ratio Multi-channel Wireless Mesh Networks","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Nash equilibrium; Wireless mesh network; Computer network; Embarrassment; Game theory; Routing (electronic design automation); Wireless network; Channel (broadcasting); Wireless; Transmission (telecommunications); Interference (communication); Potential game; Distributed computing; Mathematical optimization; Telecommunications; Mathematical economics; 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.0007021551,0.0003919203,0.0006198845,0.0004401435,0.0003366301,0.000633337,0.001426155,0.0004615249,0.000999896],"category_scores_gemma":[0.001719828,0.000288448,0.0003283992,0.0005567393,0.0004670602,0.001015713,0.0008279565,0.0005643823,0.000233419],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003703707,"about_ca_system_score_gemma":0.0001595992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002344258,"about_ca_topic_score_gemma":0.0004001432,"domain_scores_codex":[0.9995782,0.0001485583,0.00001819716,0.00005579669,0.0001522785,0.00004697356],"domain_scores_gemma":[0.9991208,0.0005638787,0.00007205542,0.00009901057,0.0001161668,0.00002816274],"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.0002947179,0.0001291092,0.000911525,0.0003738846,0.0001214132,0.0003359948,0.0003318859,0.6019737,0.05066364,0.08534122,0.005714903,0.2538081],"study_design_scores_gemma":[0.00001086044,0.00008321257,0.000201136,0.00001180014,0.00002321115,0.0002793636,0.00003251344,0.9755964,0.004166722,0.01725733,0.002321413,0.00001604025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03123741,0.002576215,0.9590296,0.0002249177,0.0001598022,0.00003084782,0.00002638106,0.000431069,0.006283677],"genre_scores_gemma":[0.8834817,0.001658062,0.1095596,0.0001115596,0.0002108067,0.00005192427,0.00005274875,0.0001197642,0.00475383],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001426155,"threshold_uncertainty_score":0.003713429,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02337255677623723,"score_gpt":0.2456993827548776,"score_spread":0.2223268259786404,"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."}}