{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001395993,0.00127251,0.0009887791,0.0006362413,0.0007885863,0.002792548,0.00315081,0.001591313,0.008469284],"category_scores_gemma":[0.002816534,0.0005582048,0.001246097,0.0008574108,0.001841716,0.00382953,0.003068814,0.005219556,0.001278933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009181179,"about_ca_system_score_gemma":0.0009716839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006247092,"about_ca_topic_score_gemma":0.001111092,"domain_scores_codex":[0.9988777,0.0003816489,0.00007781485,0.0001940884,0.0003962697,0.00007247437],"domain_scores_gemma":[0.9991835,0.0005120047,0.00004985952,0.00009344381,0.00008737142,0.00007376606],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007942992,0.00005431506,0.00008985658,0.0002360818,0.00005811472,0.00008492008,0.0001770062,0.04332076,0.003022873,0.8856336,0.005544008,0.06169908],"study_design_scores_gemma":[0.00003900728,0.00007749643,0.00004922394,0.00005870213,0.00002535596,0.0001274554,0.0000299983,0.3473206,0.0015231,0.6317335,0.01899667,0.000018964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001986157,0.0007834667,0.9793677,0.0004168002,0.0001818994,0.00004994398,0.0000395357,0.0001986508,0.01697571],"genre_scores_gemma":[0.1831838,0.00220614,0.7818483,0.0007557503,0.0005049838,0.0005704339,0.0001421624,0.0003022305,0.0304863],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008469284,"threshold_uncertainty_score":0.02833259,"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."}}