{"id":"W62077061","doi":"","title":"Channel-relay price pair: towards arbitrating incentives in wireless ad hoc networks: Research Articles","year":2006,"lang":"en","type":"article","venue":"Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Wireless ad hoc network; Computer network; Computer science; Relay; Wireless network; Node (physics); Bargaining problem; Game theory; Incentive; Wireless; Nash equilibrium; Channel (broadcasting); Pareto principle; Resource management (computing); Mathematical optimization; Telecommunications; Microeconomics; Economics; Engineering","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.002523313,0.0001820196,0.0002448093,0.000271017,0.001325053,0.0004242192,0.002173505,0.00008283662,0.00000328935],"category_scores_gemma":[0.00006548299,0.0001875945,0.00005208507,0.001650441,0.0003271567,0.0004011257,0.003504219,0.0007600598,0.000005522225],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001128796,"about_ca_system_score_gemma":0.00009275944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005556915,"about_ca_topic_score_gemma":0.0003077343,"domain_scores_codex":[0.997179,0.001076572,0.0005506819,0.0004291719,0.0002350442,0.0005294936],"domain_scores_gemma":[0.996505,0.001041279,0.0001504986,0.001882963,0.0003298757,0.00009035913],"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.00000807487,0.000440654,0.003839089,0.00002888343,0.00002106479,0.000004489413,0.006853042,0.007523376,0.001198247,0.08174422,0.0003671316,0.8979717],"study_design_scores_gemma":[0.0003706888,0.00007149063,0.007693915,0.0002573055,0.000002472989,0.000007486622,0.0006450984,0.9817349,0.0001734394,0.001054773,0.007747044,0.0002413978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5558788,0.08041499,0.3543863,0.002940313,0.0001615173,0.0009920179,0.000001554178,0.0003955677,0.004828906],"genre_scores_gemma":[0.9707296,0.009413242,0.01949921,0.0001099262,0.00005577381,0.0001055761,0.00001164384,0.00001551548,0.00005952973],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9742115,"threshold_uncertainty_score":0.9999751,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0657013673395086,"score_gpt":0.3415110404339394,"score_spread":0.2758096730944308,"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."}}