{"id":"W2067752506","doi":"10.1109/tvt.2011.2170446","title":"An Auction-Based Pareto-Optimal Strategy for Dynamic and Fair Allotment of Resources in Wireless Mobile Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Quality of service; Computer network; Roaming; Reservation; Flexibility (engineering); Wireless; Handover; Pareto principle; Mobile computing; Wireless network; Distributed computing; Telecommunications; 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":[],"consensus_categories":[],"category_scores_codex":[0.0001841389,0.0001343304,0.0001947767,0.0003551151,0.0001466813,0.00001914252,0.0005147484,0.0001813811,0.000007554737],"category_scores_gemma":[0.000001489584,0.000135387,0.00004876511,0.0005078004,0.0001635414,0.0001356477,0.000005375927,0.000246347,6.522126e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004737544,"about_ca_system_score_gemma":0.00003421268,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001606002,"about_ca_topic_score_gemma":0.0003305243,"domain_scores_codex":[0.9990577,0.00008461798,0.0002564438,0.0003248985,0.00007509278,0.0002012639],"domain_scores_gemma":[0.9991361,0.00006019625,0.00007894091,0.0005966461,0.00008608271,0.0000420188],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000798743,0.0007356508,0.0002150754,0.00001915905,0.00004779945,0.000005365634,0.0005734731,0.6924388,0.00500104,0.00461778,0.000003204966,0.2962628],"study_design_scores_gemma":[0.0005602769,0.0008516783,0.0003949258,0.00003334327,0.00001032449,0.000005345201,0.0001825082,0.9820586,0.01545502,0.0002118679,0.00009115219,0.0001449325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3407152,0.0001538144,0.6585747,0.0000930476,0.00004956075,0.0002819238,0.000002469491,0.0001220622,0.000007192763],"genre_scores_gemma":[0.9893564,0.0002282433,0.01001082,0.00003719054,0.000003142493,0.0003440932,0.000002122937,0.00001090194,0.000007080823],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6486412,"threshold_uncertainty_score":0.552092,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02259312717664481,"score_gpt":0.2653109166736859,"score_spread":0.2427177894970411,"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."}}