{"id":"W3124249090","doi":"","title":"Resource Allocation Problems on Networks: Maximizing Social Welfare Using and Agent-Based Approach","year":2011,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Resource allocation; Computer science; Social Welfare; Welfare; Resource (disambiguation); Resource management (computing); Max-min fairness; Mathematical optimization; Distributed computing; Economics; Computer network; Mathematics","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.004300065,0.001864632,0.002525328,0.00167644,0.0009333262,0.003823465,0.002458318,0.00350695,0.003307931],"category_scores_gemma":[0.008076212,0.0008209227,0.001129595,0.002393991,0.001963916,0.003669556,0.002053152,0.001652883,0.000283496],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002600007,"about_ca_system_score_gemma":0.001367575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001795138,"about_ca_topic_score_gemma":0.001627672,"domain_scores_codex":[0.9967551,0.002235853,0.00008862328,0.000298825,0.0004509719,0.0001706902],"domain_scores_gemma":[0.9961503,0.00306794,0.0002628326,0.0001112685,0.0002542575,0.0001534635],"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.00008666769,0.0001287066,0.0003723834,0.0002820266,0.0001643378,0.000105545,0.00008096226,0.8186181,0.0006234096,0.1603467,0.001822194,0.0173691],"study_design_scores_gemma":[0.00002182053,0.00002389731,0.00008682036,0.000023498,0.00002803778,0.0000260682,0.00002511927,0.921252,0.0001369142,0.07758184,0.0007857675,0.000008239619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02131384,0.0008791655,0.9640238,0.001411355,0.0001054082,0.000149721,0.00006830281,0.00006084875,0.01198763],"genre_scores_gemma":[0.7660437,0.002485933,0.2157529,0.0003574339,0.0004774932,0.0006857827,0.0001207732,0.0001188381,0.01395714],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004300065,"threshold_uncertainty_score":0.02274126,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0867360222048811,"score_gpt":0.2912993434044091,"score_spread":0.204563321199528,"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."}}