{"id":"W2953243100","doi":"10.1609/aaai.v24i1.7623","title":"An Approximate Subgame-Perfect Equilibrium Computation Technique for Repeated Games","year":2010,"lang":"en","type":"article","venue":"","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"","keywords":"Hypercube; Subgame perfect equilibrium; Discounting; Set (abstract data type); Stochastic game; Computation; Point (geometry); Integer (computer science); Mathematical optimization; Computer science; Mathematics; Mathematical economics; Algorithm; Discrete mathematics; Nash equilibrium","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.001433338,0.0008886441,0.001323943,0.0008015583,0.0007454981,0.001053676,0.002002742,0.0007260941,0.004774923],"category_scores_gemma":[0.005627455,0.0005856689,0.001616353,0.000782275,0.001123233,0.0023495,0.001341238,0.002308377,0.0008866476],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001211655,"about_ca_system_score_gemma":0.0012192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003802631,"about_ca_topic_score_gemma":0.003464672,"domain_scores_codex":[0.9989441,0.0003558829,0.00005334284,0.0001990768,0.0003419351,0.0001057303],"domain_scores_gemma":[0.9982919,0.001004493,0.0001433061,0.0003440339,0.0001707233,0.00004545318],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001800688,0.00008904198,0.0007372169,0.0001969102,0.0001145284,0.000142893,0.0004842662,0.6627612,0.006869862,0.2272855,0.001041817,0.1000967],"study_design_scores_gemma":[0.00001959728,0.00004857275,0.00006749448,0.00002018072,0.0000207677,0.00004698987,0.00002731227,0.9158458,0.002359456,0.07952467,0.002006636,0.00001242603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00400776,0.00003031399,0.9947894,0.000024416,0.000006700808,0.00004330443,0.00002100063,0.0001570637,0.0009201335],"genre_scores_gemma":[0.1449857,0.0001256451,0.8524453,0.00004453212,0.00001559895,0.0003071812,0.0001180068,0.0001377349,0.001820299],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004774923,"threshold_uncertainty_score":0.01597375,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06554374621527588,"score_gpt":0.4072513616308365,"score_spread":0.3417076154155607,"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."}}