{"id":"W4220752472","doi":"10.1016/j.ejor.2022.03.048","title":"Computing equilibria for integer programming games","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":22,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Nash equilibrium; Knapsack problem; Mathematical optimization; Computer science; Mathematical economics; Stochastic game; Class (philosophy); Integer (computer science); Integer programming; Game theory; Computation; Set (abstract data type); Outcome (game theory); Mathematics; Algorithm; Artificial intelligence","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":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.04820991,0.00006265517,0.0001414307,0.0003887154,0.001073712,0.0004965089,0.001272107,0.000006415183,0.001102353],"category_scores_gemma":[0.005887251,0.00004700584,0.0001255368,0.0007313333,0.0001419982,0.0002405314,0.0004759927,0.0005437194,0.0001186893],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006077086,"about_ca_system_score_gemma":0.0002882079,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.468378e-7,"about_ca_topic_score_gemma":2.608705e-7,"domain_scores_codex":[0.99357,0.002875247,0.0007754043,0.0002098275,0.002316318,0.0002531568],"domain_scores_gemma":[0.99434,0.00328677,0.0002202383,0.0002209401,0.001808965,0.0001230727],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000707931,0.0005321542,0.001044656,0.000008831342,0.00007732742,0.0001144256,0.005224069,0.0271554,0.02710877,0.3076939,0.1503661,0.4799665],"study_design_scores_gemma":[0.0006972458,0.0008735565,0.002150737,0.00001571583,0.000004343946,0.0002172563,0.005160393,0.009569791,0.0003815342,0.02163654,0.9591844,0.0001084702],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8297393,0.0003136493,0.1341779,0.01284421,0.0004708598,0.0006358405,0.00003492326,0.00001680836,0.02176644],"genre_scores_gemma":[0.9863023,0.000001381248,0.009321901,0.000142079,0.0004571626,0.000009093983,0.000004242496,0.00001452365,0.003747343],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8088183,"threshold_uncertainty_score":0.9998108,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.3984137943521013,"score_gpt":0.5235232665533408,"score_spread":0.1251094722012395,"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."}}