{"id":"W2808095563","doi":"10.1007/s11590-018-1285-3","title":"Improved price of anarchy for machine scheduling games with coordination mechanisms","year":2018,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Price of anarchy; Upper and lower bounds; Computational intelligence; Computer science; Scheduling (production processes); Nash equilibrium; Mathematical optimization; Job shop scheduling; Game theory; Mathematical economics; Operations research; Mathematics; Artificial intelligence; Price of stability; Economics; Computer network","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.005118484,0.001854512,0.003726615,0.001594003,0.001177883,0.003740787,0.005281732,0.004030812,0.0176603],"category_scores_gemma":[0.02343596,0.001141335,0.0016764,0.001521,0.0027814,0.007192773,0.002975493,0.005614161,0.00104014],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003560835,"about_ca_system_score_gemma":0.003057762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001314306,"about_ca_topic_score_gemma":0.001421727,"domain_scores_codex":[0.9964129,0.001827715,0.0001436548,0.0004252105,0.0007005076,0.0004901413],"domain_scores_gemma":[0.9814477,0.01417814,0.0008364793,0.001581857,0.0008317446,0.001124005],"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.0005847801,0.0003424953,0.0003792433,0.0003948625,0.0001280564,0.0002147975,0.0001714175,0.2643419,0.002624134,0.6971195,0.008892019,0.02480684],"study_design_scores_gemma":[0.0001673226,0.0001794153,0.0001951731,0.00003498029,0.00004712413,0.00008595084,0.00003789456,0.6353971,0.0003529993,0.3618098,0.001652469,0.0000397221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.105614,0.001271673,0.8285958,0.002874966,0.0008651637,0.0003698589,0.0003679709,0.000636345,0.05940433],"genre_scores_gemma":[0.8840207,0.0006903204,0.09517037,0.0005535688,0.0005835167,0.0004234171,0.0001568497,0.0003299243,0.0180713],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0176603,"threshold_uncertainty_score":0.05907953,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03089811488666547,"score_gpt":0.3182612825802636,"score_spread":0.2873631676935982,"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."}}