{"id":"W4412793654","doi":"10.1007/s11590-025-02221-5","title":"Computing approximate Nash equilibria for integer programming games","year":2025,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; Université de Toulouse; Institut de Valorisation des Données; Princeton University","keywords":"Integer programming; Computational intelligence; Nash equilibrium; Integer (computer science); Computer science; Mathematical optimization; Game theory; Mathematics; Mathematical economics; Artificial intelligence; Programming language","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.0005165842,0.0002027788,0.0002649447,0.0002903223,0.0002758209,0.0001837391,0.0002669216,0.00008498023,0.00006797387],"category_scores_gemma":[0.001211295,0.0002072037,0.00009935184,0.0006433776,0.00009641597,0.0002792313,0.0001374512,0.0001931528,0.000003951225],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001304007,"about_ca_system_score_gemma":0.00005648631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001448298,"about_ca_topic_score_gemma":5.954806e-7,"domain_scores_codex":[0.9983741,0.00009605001,0.0004509799,0.0003964812,0.0002415851,0.0004407951],"domain_scores_gemma":[0.9984887,0.000680803,0.0001719601,0.0003194956,0.0002750678,0.00006393142],"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.00004255562,0.00008566565,0.00007262857,0.000289783,0.00007382598,0.000001687008,0.0003193217,0.9593876,0.0004431021,0.0157016,0.008669013,0.01491324],"study_design_scores_gemma":[0.0008524701,0.00001682794,0.000002357543,0.000108187,0.0000242229,0.000001779859,0.0001593374,0.9929567,0.0005323004,0.001863838,0.003281728,0.0002002823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005011574,0.00002687798,0.9930997,0.003645344,0.0002371055,0.001223384,0.000006944799,0.0003517158,0.0009077013],"genre_scores_gemma":[0.002936557,0.000008246395,0.9942585,0.001060139,0.00008444797,0.0001473123,0.00007660036,0.00005841553,0.001369763],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03356909,"threshold_uncertainty_score":0.844952,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03253869857474278,"score_gpt":0.3641884720331356,"score_spread":0.3316497734583929,"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."}}