{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001115123,0.00008290996,0.0001993518,0.0006332844,0.0001154759,0.0003097135,0.000674627,0.00002280109,0.00001850894],"category_scores_gemma":[0.0001518731,0.00007872022,0.00007877531,0.0002885144,0.0001729317,0.001101895,0.00007983824,0.00007376928,0.00001413602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001114858,"about_ca_system_score_gemma":0.0001401248,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001125794,"about_ca_topic_score_gemma":0.000002285516,"domain_scores_codex":[0.9989727,0.000005946125,0.0005665423,0.0001941814,0.0001180599,0.000142629],"domain_scores_gemma":[0.9983567,0.0001626823,0.0008185057,0.0001473013,0.0004652632,0.00004954864],"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.00015437,0.00007051733,0.001008946,0.0000102715,0.00008346618,9.368766e-7,0.0006410438,0.1773313,0.0009837624,0.8103378,0.00008244592,0.009295131],"study_design_scores_gemma":[0.001423671,0.0003648459,0.003763814,0.0001417462,0.000005398988,0.00002222659,0.00004443764,0.7842298,0.002188909,0.204199,0.00342551,0.0001906579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5100716,0.000005526991,0.4870986,0.001079835,0.00132965,0.00009219204,0.00002943234,0.000009640676,0.0002834838],"genre_scores_gemma":[0.966893,0.000010654,0.03255629,0.00008436047,0.0003653168,0.000006229045,0.00001296988,0.000009239299,0.00006200452],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6068985,"threshold_uncertainty_score":0.3210117,"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."}}