{"id":"W1490582271","doi":"10.1609/aaai.v24i1.7623","title":"An Approximate Subgame-Perfect Equilibrium Computation Technique for Repeated Games","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"","keywords":"Hypercube; Subgame perfect equilibrium; Discounting; Set (abstract data type); Stochastic game; Mathematical optimization; Computer science; Computation; Integer (computer science); Point (geometry); Mathematical economics; Mathematics; Algorithm; Nash equilibrium; Parallel computing","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.001463475,0.0009078255,0.001340723,0.0008349618,0.0007709534,0.00113721,0.002143555,0.0007822724,0.005185092],"category_scores_gemma":[0.005996634,0.0006252627,0.001669322,0.0008256867,0.001094882,0.002473932,0.001408143,0.002396676,0.0009776899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001268221,"about_ca_system_score_gemma":0.001299912,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004111889,"about_ca_topic_score_gemma":0.003887557,"domain_scores_codex":[0.9989243,0.0003507849,0.00005392277,0.0001964631,0.0003659272,0.0001085545],"domain_scores_gemma":[0.998314,0.0009728522,0.000141173,0.0003481395,0.0001770454,0.00004673196],"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.0001833811,0.00008980181,0.0007476847,0.0001919226,0.000113813,0.000148366,0.0004955273,0.6597254,0.006521335,0.2301569,0.001137289,0.1004886],"study_design_scores_gemma":[0.00001933046,0.00004234921,0.0000623446,0.00001874733,0.00001947663,0.0000435689,0.00002648829,0.9230718,0.002110282,0.07259785,0.001976464,0.00001131293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003996752,0.00003029343,0.9946941,0.00002650419,0.000007249776,0.00004523818,0.00002296253,0.0001835481,0.0009933866],"genre_scores_gemma":[0.1347961,0.0001145725,0.8625469,0.00004661947,0.00001589676,0.0002976284,0.0001237894,0.0001536259,0.001904954],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005185092,"threshold_uncertainty_score":0.01734591,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.152146424044343,"score_gpt":0.4087009792683248,"score_spread":0.2565545552239818,"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."}}