{"id":"W4317402046","doi":"10.1142/s0129054122460078","title":"Approximate Nash Equilibria for Scheduling Game on Serial-Batching-Machines with Activation Cost","year":2023,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Nash equilibrium; Computer science; Scheduling (production processes); Price of anarchy; Mathematical optimization; Best response; Schedule; Single-machine scheduling; Game theory; Job shop scheduling; Mathematical economics; Mathematics; Price of stability; Economics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00158612,0.001183718,0.001385815,0.0006368161,0.0009367923,0.00167537,0.00157789,0.001296844,0.004129524],"category_scores_gemma":[0.008921573,0.0004894685,0.0007581948,0.0006793232,0.001623747,0.00276115,0.001449178,0.00144381,0.0003787114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002324762,"about_ca_system_score_gemma":0.002107484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005631205,"about_ca_topic_score_gemma":0.00405664,"domain_scores_codex":[0.9985521,0.0006648324,0.00006865887,0.0002556646,0.0002271611,0.0002315529],"domain_scores_gemma":[0.996138,0.002511734,0.0004586985,0.0002677212,0.0003311791,0.0002925682],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003410045,0.0001347964,0.0009310642,0.0001131876,0.00006008374,0.0001715432,0.0002551914,0.5973575,0.003039631,0.3852734,0.00125029,0.01107226],"study_design_scores_gemma":[0.00004036363,0.00004341874,0.000128423,0.000007518388,0.000009247053,0.00003008494,0.00004367243,0.8494145,0.000546905,0.1492769,0.0004466102,0.00001237514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1860721,0.0001244584,0.8019289,0.0004799813,0.00003830627,0.000209353,0.0001965298,0.0001937226,0.01075659],"genre_scores_gemma":[0.900977,0.0001709095,0.09231644,0.0001148654,0.00002896222,0.0003215598,0.0001604176,0.0000621807,0.005847608],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005631205,"threshold_uncertainty_score":0.0168674,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04616414074008578,"score_gpt":0.2970640167723764,"score_spread":0.2508998760322906,"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."}}