{"id":"W3214154353","doi":"10.1287/opre.2023.0327","title":"The Cut-and-Play Algorithm: Computing Nash Equilibria via Outer Approximations","year":2025,"lang":"en","type":"preprint","venue":"Operations Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal; Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Polyhedron; Convex hull; Correctness; Cutting-plane method; Nash equilibrium; Mathematical optimization; Integer programming; Leverage (statistics); Computer science; Extreme point; Mathematics; Hull; Regular polygon; Algorithm; Combinatorics; 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":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.01394423,0.0002362314,0.0003352474,0.0005689992,0.004350686,0.004015723,0.002550711,0.0002564926,0.0002196585],"category_scores_gemma":[0.003267067,0.0001574336,0.0001387631,0.001542828,0.000814606,0.000228955,0.004211592,0.001693527,0.0007676308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009445856,"about_ca_system_score_gemma":0.0008285207,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001380778,"about_ca_topic_score_gemma":0.0002783485,"domain_scores_codex":[0.9936917,0.001931423,0.0009749539,0.001017403,0.001816491,0.0005680555],"domain_scores_gemma":[0.9893724,0.00621395,0.00008696872,0.002163273,0.001985526,0.0001778283],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001680623,0.000220994,0.000103287,0.00003105704,0.0001375747,0.000004514045,0.004785936,0.02060212,0.0007975496,0.2962144,0.03488123,0.6422045],"study_design_scores_gemma":[0.0001468759,0.00002001672,0.0003356672,0.00005771666,0.00001397174,0.000008058447,0.001169181,0.7494182,0.0002519755,0.1747444,0.07362176,0.0002121269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04548827,0.0009733607,0.8626502,0.03363721,0.001090036,0.003737982,0.0005787559,0.0001793652,0.05166482],"genre_scores_gemma":[0.6943399,0.0004043201,0.07611086,0.0004005342,0.001131458,0.001980549,0.0003492869,0.00005794327,0.2252252],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7865393,"threshold_uncertainty_score":0.9970182,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2378280214313098,"score_gpt":0.5207650283026936,"score_spread":0.2829370068713838,"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."}}