{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004535351,0.0001275152,0.0001736943,0.0001167221,0.0001110634,0.0005253443,0.0005503106,0.00008604555,0.000001723349],"category_scores_gemma":[0.0002379939,0.0001043097,0.00004439329,0.0002423238,0.00002144916,0.0005988957,0.0002090044,0.0001745461,0.000001206601],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005134824,"about_ca_system_score_gemma":0.00007330594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001439303,"about_ca_topic_score_gemma":9.987124e-7,"domain_scores_codex":[0.9989464,0.00001118072,0.0003673155,0.0002139683,0.0002755435,0.0001855914],"domain_scores_gemma":[0.9989347,0.00007703625,0.0002875749,0.00008240572,0.0005740431,0.00004417901],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002553284,0.000303119,0.04130425,0.001502835,0.0002330999,0.00001050643,0.007058368,0.2800748,0.02212391,0.6370587,0.0007317305,0.009343277],"study_design_scores_gemma":[0.0006137627,0.00002806278,0.002711748,0.001312551,0.00000348014,0.00001186319,0.0005604888,0.9905327,0.003402749,0.0003562458,0.0003465618,0.0001198033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.692215,0.0003551763,0.2969721,0.003663863,0.0014844,0.002908068,0.00009465497,0.0006016223,0.001705161],"genre_scores_gemma":[0.9793661,0.00001370798,0.02013011,0.00009760613,0.00003382899,0.0003079267,0.00002059027,0.000005143168,0.00002494498],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7104579,"threshold_uncertainty_score":0.5065907,"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."}}