{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002361933,0.001373101,0.001394369,0.0009552854,0.0007161787,0.001664216,0.001359656,0.001096871,0.002940427],"category_scores_gemma":[0.009749671,0.0006075575,0.000690276,0.0007148791,0.001309253,0.002053168,0.001799931,0.001908315,0.0003575672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00183905,"about_ca_system_score_gemma":0.001469501,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005395939,"about_ca_topic_score_gemma":0.00435775,"domain_scores_codex":[0.9986963,0.0006520955,0.00004722286,0.0001744116,0.0002807023,0.0001493051],"domain_scores_gemma":[0.997328,0.001879002,0.0002169634,0.0002022959,0.0002643945,0.0001093155],"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.00006328047,0.00003091806,0.0003140038,0.00002699063,0.00002097889,0.00003234924,0.00004461879,0.9601049,0.0004831973,0.03095435,0.0001538248,0.007770644],"study_design_scores_gemma":[0.000003802784,0.000009257457,0.00001371972,0.000002555022,0.000001649303,0.000003450153,0.000007905647,0.9895675,0.000169673,0.01013851,0.00008043069,0.000001570388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02585488,0.00007674887,0.9720389,0.00009189518,0.00001516385,0.00004298653,0.00002462029,0.0001710464,0.001683934],"genre_scores_gemma":[0.7078556,0.0001179222,0.2898249,0.00007097306,0.00001783289,0.0001528721,0.0001017071,0.00009343853,0.001764706],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005395939,"threshold_uncertainty_score":0.01334333,"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."}}