{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009707422,0.00009045724,0.0001429743,0.000179298,0.0001694639,0.00006961911,0.0002958807,0.00003411323,0.0001972842],"category_scores_gemma":[0.0004116308,0.0000675963,0.00004189985,0.00065031,0.0001484594,0.0002539514,0.00002929226,0.00004025555,0.000009786816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001580142,"about_ca_system_score_gemma":0.00002408183,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000460892,"about_ca_topic_score_gemma":0.000003634217,"domain_scores_codex":[0.9989004,0.00006161897,0.000320382,0.0002820124,0.0002995849,0.0001360758],"domain_scores_gemma":[0.9984396,0.0003704091,0.000314554,0.0003186986,0.0005118266,0.0000449657],"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.0003213277,0.0001065669,0.000168504,0.00001435827,0.0000413044,2.330433e-7,0.0007999407,0.7347412,0.1922725,0.06159624,0.001014007,0.00892386],"study_design_scores_gemma":[0.0006344971,0.0001937605,0.0000763332,0.00001131976,0.00001859138,0.000001589142,0.0002146206,0.9603597,0.03168796,0.005833223,0.0008415266,0.0001269016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02998865,0.000004444049,0.9634992,0.005640648,0.00005995739,0.0003869655,0.00001957881,0.00003210486,0.0003684379],"genre_scores_gemma":[0.624825,6.4285e-7,0.3741679,0.0007027719,0.00003756729,0.00004101027,0.00001790029,0.00000962259,0.000197555],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5948363,"threshold_uncertainty_score":0.2756497,"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."}}