{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001076141,0.0003138212,0.0004046558,0.0002067077,0.00108833,0.0004085155,0.002446922,0.0001291355,0.000002998837],"category_scores_gemma":[0.00001837871,0.0003318626,0.00008898302,0.001218081,0.0002527903,0.0004949553,0.002984853,0.0007223601,0.000003975757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001166198,"about_ca_system_score_gemma":0.00009704356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006465937,"about_ca_topic_score_gemma":0.0003055137,"domain_scores_codex":[0.9973152,0.0006228851,0.0007506306,0.0005531443,0.0002098318,0.000548283],"domain_scores_gemma":[0.9966919,0.0005912588,0.0003200694,0.002077983,0.0002106984,0.0001080482],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009696885,0.0006295294,0.004006916,0.00004418617,0.00003613471,0.000006734009,0.004389412,0.01666391,0.001187446,0.07127655,0.0002238059,0.9015257],"study_design_scores_gemma":[0.0005429765,0.00005793233,0.005046227,0.000292386,0.00000562637,0.00001460542,0.0002895265,0.9851711,0.0001424361,0.0002228606,0.007805647,0.0004086281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3726559,0.03750433,0.5830778,0.001585231,0.0002367987,0.0008411126,0.00000297053,0.0005179527,0.003577935],"genre_scores_gemma":[0.9699936,0.01180064,0.01760977,0.0002874382,0.00006707171,0.0001205854,0.00003378827,0.00002622703,0.00006091059],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9685072,"threshold_uncertainty_score":0.9999133,"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."}}