{"id":"W1990004194","doi":"10.1002/wcm.383","title":"Channel‐relay price pair: towards arbitrating incentives in wireless <i>ad hoc</i> networks","year":2006,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Relay; Node (physics); Wireless network; Wireless; Game theory; Nash equilibrium; Bargaining problem; Incentive; Shared resource; Channel (broadcasting); Mathematical optimization; Telecommunications; Microeconomics; Economics","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.005183567,0.0005385004,0.0007405621,0.0005834622,0.0007206704,0.001592463,0.001652045,0.001515934,0.002454496],"category_scores_gemma":[0.01023784,0.0003940156,0.0004692468,0.0005429576,0.002241254,0.0027316,0.00182333,0.001207758,0.0002918894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007035533,"about_ca_system_score_gemma":0.001008644,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004267525,"about_ca_topic_score_gemma":0.000275496,"domain_scores_codex":[0.9977087,0.001531468,0.00006779892,0.0001489414,0.0003546855,0.0001884797],"domain_scores_gemma":[0.9964603,0.002101372,0.0004689794,0.0003231639,0.0003736467,0.000272577],"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.0004287491,0.0001729539,0.001137977,0.0001411687,0.00006600562,0.0003800974,0.0004086104,0.3367972,0.01004806,0.6097634,0.002274987,0.03838076],"study_design_scores_gemma":[0.0001448357,0.0002147992,0.0001491387,0.00001929551,0.00002660613,0.0001546014,0.00008058298,0.7944254,0.002786768,0.1992198,0.002749806,0.00002824539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09798401,0.0002825312,0.8921921,0.0008596224,0.0001297915,0.0001704259,0.00001790381,0.0001915331,0.0081721],"genre_scores_gemma":[0.9055683,0.0001339096,0.09159231,0.0001431938,0.00004908664,0.0001331009,0.000009215387,0.00002677046,0.002344124],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005183567,"threshold_uncertainty_score":0.02741361,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01885378871297629,"score_gpt":0.2640116614802911,"score_spread":0.2451578727673149,"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."}}