{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003625065,0.0009302367,0.001221907,0.0008874387,0.001119186,0.002241444,0.002202223,0.001573505,0.002652983],"category_scores_gemma":[0.005048015,0.0004867423,0.0008204815,0.001076823,0.002109242,0.002332304,0.001433648,0.001167862,0.0004674713],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002173414,"about_ca_system_score_gemma":0.003044637,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002408407,"about_ca_topic_score_gemma":0.002108167,"domain_scores_codex":[0.9980733,0.001025142,0.00006960527,0.0001394296,0.0004847126,0.0002077027],"domain_scores_gemma":[0.998743,0.0007133508,0.0001159183,0.0001106978,0.0002008332,0.0001161693],"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.0002207847,0.0001483061,0.0002984258,0.0001803247,0.00007458184,0.0002470154,0.0002652155,0.5435501,0.004422232,0.4054664,0.002878837,0.04224791],"study_design_scores_gemma":[0.00006637755,0.00008542959,0.00006773012,0.00001961017,0.00001498673,0.00009340475,0.00003212675,0.9170111,0.0004918989,0.08031731,0.001771682,0.000028328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01553206,0.0003488925,0.9748635,0.0002664092,0.00005372618,0.0001665703,0.00003466925,0.00009866219,0.008635489],"genre_scores_gemma":[0.7361604,0.0005817923,0.2556203,0.0001466843,0.00007152926,0.0003938442,0.0000552013,0.00006059036,0.006909735],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003625065,"threshold_uncertainty_score":0.01917142,"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."}}