{"id":"W2475215202","doi":"10.1145/2875441","title":"Multiagent Resource Allocation for Dynamic Task Arrivals with Preemption","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Intelligent Systems and Technology","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Preemption; Computer science; Leverage (statistics); Task (project management); Distributed computing; Proxy (statistics); Resource (disambiguation); Resource allocation; Multi-agent system; Computer network; Artificial intelligence; Machine learning","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.002114577,0.0008582163,0.001050409,0.0005157133,0.001044677,0.001334585,0.001993363,0.0009953191,0.00209973],"category_scores_gemma":[0.005498401,0.0004610594,0.0004951886,0.0005646219,0.0008418846,0.001869457,0.001816159,0.001456811,0.0005042811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001123609,"about_ca_system_score_gemma":0.001609799,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00291132,"about_ca_topic_score_gemma":0.002815946,"domain_scores_codex":[0.9986653,0.0005189084,0.00007925968,0.0002878226,0.0002721297,0.0001764977],"domain_scores_gemma":[0.9980059,0.001051963,0.0002485322,0.0002687496,0.0002465712,0.0001782038],"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.0001363417,0.000101492,0.000536837,0.00007510364,0.00004086504,0.000141286,0.0001548883,0.9195549,0.003085182,0.02639017,0.001477212,0.04830577],"study_design_scores_gemma":[0.00001308841,0.00002123701,0.00004224914,0.000003194217,0.000005045441,0.00002250996,0.00001343256,0.9922896,0.0004005186,0.006285051,0.0008999215,0.000004182259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01248275,0.0001608661,0.9853731,0.0001513028,0.00004190583,0.0000564525,0.00001183866,0.000253749,0.00146805],"genre_scores_gemma":[0.6685856,0.0002136187,0.3257443,0.0001505645,0.00007933775,0.000250165,0.00005589166,0.000119581,0.004800999],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00291132,"threshold_uncertainty_score":0.01118308,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01873880117814438,"score_gpt":0.2621758147648627,"score_spread":0.2434370135867183,"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."}}