{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004512069,0.0007304163,0.000871967,0.0007406087,0.0009842906,0.002690886,0.001664708,0.002613871,0.003974166],"category_scores_gemma":[0.009222562,0.0004952005,0.000690813,0.001339319,0.002891567,0.004976765,0.001303728,0.00198117,0.0006836031],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000993063,"about_ca_system_score_gemma":0.001270593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005103119,"about_ca_topic_score_gemma":0.0002913692,"domain_scores_codex":[0.9982331,0.001000186,0.00005979715,0.0001554476,0.000411234,0.0001401342],"domain_scores_gemma":[0.996822,0.002130969,0.0002233453,0.0002169608,0.0004279979,0.0001786744],"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.0002017529,0.0001472713,0.0006882981,0.0003578883,0.00006441267,0.0002215154,0.0002829542,0.08020565,0.003412187,0.8010877,0.005008901,0.1083215],"study_design_scores_gemma":[0.0001441362,0.0002959745,0.000269877,0.000104578,0.00006078343,0.0003384271,0.0001597553,0.3379448,0.002479134,0.6311936,0.02695822,0.00005060023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03074163,0.005847034,0.9399062,0.003069749,0.0007805076,0.0002064322,0.00002515999,0.0001723221,0.01925097],"genre_scores_gemma":[0.6274903,0.007293529,0.3453844,0.0007621719,0.00120518,0.0004122918,0.00004799366,0.0001149851,0.01728912],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004512069,"threshold_uncertainty_score":0.02386242,"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."}}