{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00322865,0.0001226005,0.0001868089,0.0001585717,0.0001415403,0.0002509617,0.0005986613,0.0001080309,0.0003956655],"category_scores_gemma":[0.0006974654,0.00008766398,0.00008973645,0.0004886644,0.000137301,0.0003757343,0.00004551193,0.0001424859,0.0001395446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006603953,"about_ca_system_score_gemma":0.00003675953,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009944022,"about_ca_topic_score_gemma":0.00001947251,"domain_scores_codex":[0.9984151,0.0001130122,0.0004307863,0.000496047,0.00032876,0.000216264],"domain_scores_gemma":[0.9977789,0.0008581624,0.000155212,0.0007384494,0.0003517491,0.0001175057],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003558606,0.00009402314,0.0003539636,0.000003185491,0.000003540138,2.955173e-7,0.000143077,0.0001314683,0.9236635,0.05617107,0.001678025,0.01772225],"study_design_scores_gemma":[0.0002785834,0.0001608649,0.001319953,0.000003266532,0.000009583887,0.00001899073,0.0002501292,0.04638037,0.4816998,0.4633694,0.00629069,0.0002183643],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.461976,0.000001924987,0.5296347,0.000402529,0.000100828,0.0007190985,0.00001614337,0.000203935,0.006944881],"genre_scores_gemma":[0.9450585,2.248193e-7,0.05266277,0.0001368593,0.00007330986,0.000329213,0.00002937443,0.00001451734,0.001695207],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4830826,"threshold_uncertainty_score":0.433226,"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."}}