{"id":"W38575530","doi":"10.1111/acer.15309","title":"Competing in a queue for resource allocations among non-cooperative agents","year":2002,"lang":"en","type":"article","venue":"European Conference on Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Saskatchewan","funders":"Canadian Institutes of Health Research","keywords":"Computer science; Queue; Queueing theory; Nash equilibrium; Scheduling (production processes); Service (business); Resource allocation; Operations research; Mathematical optimization; Computer network; Economics; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002417671,0.0001868011,0.0002238646,0.0002620059,0.0004682355,0.0003737193,0.0009276736,0.00004367849,0.00200129],"category_scores_gemma":[0.002274344,0.0001650067,0.00008934162,0.00089033,0.000318005,0.0002214576,0.0000963566,0.0002560893,0.004705366],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003865307,"about_ca_system_score_gemma":0.0000251179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001847807,"about_ca_topic_score_gemma":0.0001806356,"domain_scores_codex":[0.99708,0.0005894884,0.000911877,0.0006847768,0.0004260608,0.0003077957],"domain_scores_gemma":[0.9975355,0.001088057,0.000267614,0.0006027632,0.0003726831,0.0001333598],"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.00007717659,0.000581927,0.0004674352,0.000004498941,0.0000130561,0.00001361796,0.01463786,0.01830538,0.001940257,0.5920037,0.003979699,0.3679754],"study_design_scores_gemma":[0.0001817435,0.0003804596,0.004379798,0.0002126841,0.00001475565,0.00000574175,0.03241763,0.8046325,0.01831639,0.09816907,0.04042574,0.0008634394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1577311,0.0000146497,0.568881,0.00386535,0.0002768735,0.001079892,0.00004079757,0.000109122,0.2680012],"genre_scores_gemma":[0.9943649,0.000008374413,0.000628243,0.0004719666,0.0001313791,0.00007116701,0.000007530358,0.00002021971,0.004296263],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8366337,"threshold_uncertainty_score":0.998911,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.3515268814406154,"score_gpt":0.4090583399620887,"score_spread":0.05753145852147329,"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."}}