{"id":"W3131156720","doi":"10.1609/icaps.v31i1.15972","title":"Distributed Fair Scheduling for Information Exchange in Multi-Agent Systems","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Fairness measure; Distributed computing; Scheduling (production processes); Information exchange; Queueing theory; Maximum throughput scheduling; Computer network; Throughput; Dynamic priority scheduling; Round-robin scheduling; Mathematical optimization; Wireless; Quality of service","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.006391339,0.001352522,0.002016052,0.001170194,0.002555469,0.002487238,0.003474266,0.001744349,0.002631066],"category_scores_gemma":[0.01088533,0.0005138676,0.000829375,0.001640994,0.002037822,0.002805474,0.001992202,0.002008831,0.0004919408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004486207,"about_ca_system_score_gemma":0.004965806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007865684,"about_ca_topic_score_gemma":0.005722222,"domain_scores_codex":[0.9965118,0.001307283,0.000218025,0.0005495956,0.001065874,0.0003475776],"domain_scores_gemma":[0.9960499,0.002362471,0.0003085666,0.0003599802,0.0006831398,0.000235869],"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.0001738048,0.0000969651,0.0003889621,0.000185932,0.00005815274,0.0001582058,0.0002202999,0.7624261,0.001965098,0.1859661,0.002360169,0.04600024],"study_design_scores_gemma":[0.00003029605,0.00002632008,0.00004000402,0.000008571978,0.000009818285,0.00001510222,0.00001508591,0.961237,0.0003217673,0.03651963,0.001765773,0.00001070354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003482458,0.0006024604,0.9934509,0.000219294,0.0001689462,0.0001426513,0.00002644707,0.0001827967,0.001724108],"genre_scores_gemma":[0.619772,0.001437781,0.3718599,0.0002373349,0.000494616,0.0007338187,0.0001481305,0.0001314407,0.005184961],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007865684,"threshold_uncertainty_score":0.03380102,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06390188017009031,"score_gpt":0.3118790732461267,"score_spread":0.2479771930760364,"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."}}