{"id":"W2025466430","doi":"10.1145/544741.544782","title":"A multi-agent queuing model for resource allocations in a non-cooperative game","year":2002,"lang":"en","type":"article","venue":"","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Nash equilibrium; Queueing theory; Scheduling (production processes); Strategy; Service (business); Resource allocation; Game theory; Resource (disambiguation); Operations research; Queue; Mathematical optimization; Distributed computing; Computer network; Microeconomics; Engineering; Business; Economics; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008793706,0.00008595137,0.0001334216,0.0001646184,0.0001878333,0.00009181225,0.0003344025,0.00004692857,0.0005793475],"category_scores_gemma":[0.0006989622,0.00006559677,0.00006609433,0.0005906232,0.00006346947,0.000205078,0.00004513838,0.00007874829,0.0004936435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003714173,"about_ca_system_score_gemma":0.0000165954,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001278293,"about_ca_topic_score_gemma":0.0002046297,"domain_scores_codex":[0.9987743,0.00005993626,0.0004087629,0.0003580816,0.0002342844,0.0001646397],"domain_scores_gemma":[0.998753,0.0005444826,0.00008059693,0.0003809104,0.000169349,0.00007173502],"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.00002658252,0.0007009685,0.0001847133,0.000003063714,0.00001431389,7.328449e-7,0.02329014,0.8192793,0.003943609,0.0882825,0.04201503,0.022259],"study_design_scores_gemma":[0.0003544635,0.00001178921,0.0001430534,0.000004040375,0.000002509975,0.000001230594,0.002201488,0.9746723,0.0002957571,0.007754955,0.01446922,0.00008920161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0193753,0.00002213293,0.9699544,0.003342353,0.00002216532,0.0005067983,0.00001388357,0.00003556043,0.006727452],"genre_scores_gemma":[0.8923452,0.000003361197,0.03037369,0.000644933,0.00001827408,0.000380111,0.000002478417,0.000007066223,0.07622484],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9395807,"threshold_uncertainty_score":0.6344953,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2311252688568031,"score_gpt":0.4087017926489264,"score_spread":0.1775765237921233,"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."}}