{"id":"W2014452425","doi":"10.1016/j.adhoc.2010.06.001","title":"Joint random access and power control game in ad hoc networks with noncooperative users","year":2010,"lang":"en","type":"article","venue":"Ad Hoc Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Nash equilibrium; Random access; Wireless ad hoc network; Power control; Best response; Mathematical optimization; Game theory; Asynchronous communication; Constraint (computer-aided design); Strategy; Uniqueness; Node (physics); Non-cooperative game; Distributed computing; Computer network; Power (physics); Wireless; Mathematical economics; Mathematics; Telecommunications","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.0008667876,0.0003825242,0.0005629058,0.0001439401,0.0003008023,0.0007421263,0.001302082,0.0002158268,0.00007678066],"category_scores_gemma":[0.0000596314,0.0003074799,0.00007335812,0.0009043872,0.0002562446,0.001064882,0.0006438169,0.001336801,0.000008223036],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000505519,"about_ca_system_score_gemma":0.0001045883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003801193,"about_ca_topic_score_gemma":0.00194266,"domain_scores_codex":[0.9975666,0.0003865415,0.000473892,0.0006863546,0.0002474953,0.0006390682],"domain_scores_gemma":[0.9976576,0.0005303608,0.0002003235,0.001098896,0.0002564158,0.0002563784],"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.001930504,0.0005043776,0.01219368,0.00001777022,0.0003720855,0.0002012776,0.008162225,0.2682478,0.0004775837,0.01659543,0.006723563,0.6845737],"study_design_scores_gemma":[0.007594531,0.0002891979,0.01738722,0.0001521075,0.00001913302,0.00003714148,0.00005431055,0.9577434,0.00002088919,0.00009592104,0.01599827,0.0006078482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1090226,0.01825635,0.8649581,0.003279579,0.001024397,0.001293617,0.000002283586,0.0002571884,0.001905815],"genre_scores_gemma":[0.983545,0.01061487,0.003152784,0.00228396,0.0001238795,0.00008557879,0.000007501952,0.00003265769,0.0001537703],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8745223,"threshold_uncertainty_score":0.9999377,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01662595645129475,"score_gpt":0.2597311546715967,"score_spread":0.2431051982203019,"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."}}