{"id":"W3215243218","doi":"10.1109/tvt.2021.3131395","title":"A Double Auction Mechanism for Resource Allocation in Coded Vehicular Edge Computing","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"ca_institutions":"BC Research (Canada); University of British Columbia","funders":"Ministry of Education - Singapore; National Research Foundation Singapore","keywords":"Double auction; Computer science; Server; Cloud computing; Incentive compatibility; Auction algorithm; Edge computing; Computer network; Resource allocation; Distributed computing; Computation offloading; Incentive; Bidding; Auction theory; Operating system; Microeconomics; Revenue equivalence","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","open_science"],"consensus_categories":[],"category_scores_codex":[0.0004866142,0.0002924715,0.0003715735,0.0009428444,0.0003478095,0.0001055933,0.006297598,0.0007281622,0.000007155279],"category_scores_gemma":[0.0005993698,0.0003392514,0.0001473385,0.002314775,0.0001370068,0.0003707988,0.0005904202,0.0008157775,0.00002875309],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000318168,"about_ca_system_score_gemma":0.0001359747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003072888,"about_ca_topic_score_gemma":0.0001288383,"domain_scores_codex":[0.9973881,0.00009390564,0.0005090814,0.001092421,0.0003121725,0.0006043304],"domain_scores_gemma":[0.9942456,0.0001408839,0.0001577184,0.005113399,0.000287399,0.00005500619],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002590871,0.002616683,0.00006566806,0.0003752689,0.0005232054,0.0006267485,0.0005063945,0.08335049,0.3481456,0.2821433,0.008664439,0.2727231],"study_design_scores_gemma":[0.00126566,0.0001128832,0.000007446602,0.00007770328,0.00001937175,0.0001226337,0.0001089461,0.3912565,0.5217143,0.08356378,0.001485241,0.000265555],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05078422,0.0001076188,0.9164943,0.02947144,0.0005492065,0.0005951733,0.00001253156,0.001944141,0.00004134429],"genre_scores_gemma":[0.7674526,0.00003952464,0.2318553,0.0002756108,0.00002213664,0.0002486486,0.00001837515,0.00003354636,0.0000543114],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7166684,"threshold_uncertainty_score":0.9999059,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02601390792192767,"score_gpt":0.2684394144233507,"score_spread":0.2424255065014231,"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."}}