{"id":"W26296001","doi":"10.1097/01.mpg.0000471451.55494.e4","title":"Leaf-value tables for pruning non-zero-sum games","year":2005,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Pruning; Zero-sum game; Zero (linguistics); Heuristics; Constant (computer programming); Tree (set theory); Computer science; Monotonic function; Mathematics; Game tree; Node (physics); Value (mathematics); Algorithm; Combinatorics; Discrete mathematics; Game theory; Mathematical optimization; Sequential game; Nash equilibrium; Machine learning; Mathematical economics","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","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008894796,0.0005194788,0.0004636882,0.0005283408,0.0003647294,0.001041215,0.002881224,0.0002096007,0.0006431601],"category_scores_gemma":[0.0008613036,0.000517817,0.0003059766,0.0004445148,0.000329523,0.001396472,0.0004535629,0.0004604261,0.001840806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003018043,"about_ca_system_score_gemma":0.0003162001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001690402,"about_ca_topic_score_gemma":0.0002045155,"domain_scores_codex":[0.995522,0.00009114131,0.00131291,0.001236656,0.0009898064,0.0008474855],"domain_scores_gemma":[0.9968042,0.0004851733,0.0004607727,0.0009449623,0.001037855,0.0002669725],"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.00005136137,0.0002055932,0.00002580276,0.000008900915,0.00003499219,0.000007269785,0.0008777478,0.01038214,0.009374597,0.6528462,0.0008981826,0.3252873],"study_design_scores_gemma":[0.00003779323,0.0001989359,0.00003551941,0.0001287239,0.000008592659,0.00001280323,0.0003014641,0.5343747,0.2756962,0.1747431,0.01400141,0.0004608502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006931091,0.00004212965,0.9593497,0.01640183,0.002571079,0.0007046052,0.00004679974,0.0003270782,0.01362571],"genre_scores_gemma":[0.9111679,0.00006551291,0.08451652,0.001625821,0.0008170739,0.0002173856,0.0000281841,0.00004145399,0.001520124],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9042369,"threshold_uncertainty_score":0.9999958,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1088612518925163,"score_gpt":0.3444431392907666,"score_spread":0.2355818873982503,"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."}}