{"id":"W2990854486","doi":"10.1007/978-3-030-35288-2_4","title":"Multi-Minimax: A New AI Paradigm for Simultaneously-Played Multi-player Games","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Minimax; Non-cooperative game; Game tree; Combinatorial game theory; Pruning; Sequential game; Screening game; Adversary; Repeated game; Strategy; Game theory; Artificial intelligence; Mathematical economics; Theoretical computer science; Computer security; Mathematics","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":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009040124,0.001139172,0.001150407,0.001031819,0.00036743,0.001194484,0.006703809,0.000768973,0.00005625061],"category_scores_gemma":[0.0005687173,0.001057805,0.0004150619,0.0006886536,0.0008830256,0.001077394,0.001579637,0.00123188,0.000470952],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004714312,"about_ca_system_score_gemma":0.002110518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001420107,"about_ca_topic_score_gemma":0.0006176025,"domain_scores_codex":[0.992874,0.0000517861,0.001171178,0.003149508,0.001223116,0.001530399],"domain_scores_gemma":[0.99353,0.00230073,0.0005888739,0.002646466,0.0004626165,0.0004712844],"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.00005042503,0.0001453107,0.00008144575,0.00009666544,0.00005351055,0.0001632213,0.003419323,0.1999735,0.0008471573,0.0206366,0.0004668195,0.774066],"study_design_scores_gemma":[0.0004900869,0.0003676444,0.00002331572,0.0003684907,0.00001899761,0.00008568524,7.066714e-7,0.930065,0.004858417,0.04537025,0.01708181,0.001269575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000435525,0.0007317178,0.9904613,0.001925819,0.004245523,0.001850066,0.00002576154,0.0003784317,0.0003378469],"genre_scores_gemma":[0.0502252,0.0000570041,0.9374742,0.005315371,0.0008723104,0.00003424824,0.00001246304,0.0001258742,0.005883362],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7727965,"threshold_uncertainty_score":0.9998423,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04153817435843266,"score_gpt":0.3048292802516233,"score_spread":0.2632911058931906,"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."}}