{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00285971,0.002662533,0.002172275,0.001824622,0.001120124,0.002413244,0.002431475,0.002143573,0.006492753],"category_scores_gemma":[0.01304586,0.001206587,0.001145124,0.001235211,0.001970982,0.002896888,0.002579411,0.003196183,0.001445451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001839842,"about_ca_system_score_gemma":0.002951646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01028405,"about_ca_topic_score_gemma":0.009293043,"domain_scores_codex":[0.9987676,0.000507836,0.00005173296,0.0001744267,0.0002985681,0.0001997482],"domain_scores_gemma":[0.9948092,0.004213582,0.0002094737,0.0002330114,0.0003361171,0.0001986727],"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.0002166381,0.0001201145,0.0008520561,0.0001282221,0.00006457372,0.00008276419,0.0001577426,0.8840891,0.0008446819,0.0540196,0.003198296,0.05622615],"study_design_scores_gemma":[0.0000179528,0.00001367094,0.00002555106,0.00001276761,0.000005147729,0.000007887635,0.00001510323,0.9802051,0.0002164888,0.01898586,0.0004901125,0.000004251065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008108772,0.000191858,0.9873407,0.0001531948,0.00004396939,0.00007573885,0.00005519127,0.0004469656,0.003583517],"genre_scores_gemma":[0.2005104,0.0002487447,0.793543,0.0001797136,0.00005017519,0.0003557605,0.000303661,0.0005121973,0.004296327],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01028405,"threshold_uncertainty_score":0.02172047,"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."}}