{"id":"W2026829590","doi":"10.1007/s10994-008-5091-5","title":"Effective short-term opponent exploitation in simplified poker","year":2008,"lang":"en","type":"article","venue":"Machine Learning","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"ca_institutions":"Athabasca University; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Nash equilibrium; Fictitious play; Computer science; Adversary; Best response; Bayesian game; Context (archaeology); Set (abstract data type); Convergence (economics); Game theory; Term (time); Mathematical economics; Repeated game; Artificial intelligence; Mathematical optimization; Mathematics; Computer security; Economics","routes":{"ca_aff":true,"ca_fund":true,"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.0007330627,0.0003763099,0.0008467239,0.0002870231,0.0006412342,0.0008626349,0.0009548854,0.0009915942,0.004941644],"category_scores_gemma":[0.004753449,0.0003602154,0.0002989524,0.0002178454,0.001017975,0.001559712,0.001600705,0.001193444,0.0003688441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003931944,"about_ca_system_score_gemma":0.0005922136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000971397,"about_ca_topic_score_gemma":0.00121373,"domain_scores_codex":[0.9996862,0.0001173001,0.00001186452,0.00004165976,0.00006757515,0.00007527453],"domain_scores_gemma":[0.9985185,0.0009182948,0.000101275,0.0001654488,0.00009239753,0.000204123],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001437459,0.0005417353,0.0038419,0.0001674579,0.0001198018,0.0008260389,0.0007012197,0.6580557,0.01604366,0.2392874,0.002778011,0.07619958],"study_design_scores_gemma":[0.00003315367,0.00009888829,0.0007009963,0.000005025051,0.00001023978,0.00010165,0.00005576297,0.9465172,0.0008991996,0.05124696,0.00032018,0.00001075629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7528211,0.0001538622,0.2255158,0.0003153085,0.0000668274,0.00005018643,0.0000313669,0.0002543229,0.02079116],"genre_scores_gemma":[0.9895489,0.00002265189,0.005889142,0.00001849998,0.000005780208,0.00001345456,0.00001604776,0.0000225275,0.004462886],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004941644,"threshold_uncertainty_score":0.01653147,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03764273235022859,"score_gpt":0.2966816643115067,"score_spread":0.2590389319612781,"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."}}