{"id":"W2922444559","doi":"10.24963/ijcai.2019/66","title":"Computing Approximate Equilibria in Sequential Adversarial Games by Exploitability Descent","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Alberta Machine Intelligence Institute","keywords":"Fictitious play; Convergence (economics); Nash equilibrium; Computer science; Counterfactual thinking; Benchmark (surveying); Mathematical optimization; Perfect information; Regret; Descent (aeronautics); Class (philosophy); Zero (linguistics); Imperfect; Mathematical economics; Mathematics; Economics; Artificial intelligence","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.002865974,0.001257586,0.00159064,0.000827227,0.000605612,0.00144232,0.001423534,0.001271009,0.001759504],"category_scores_gemma":[0.01068179,0.0007104154,0.0005600194,0.0006105402,0.001832643,0.001946306,0.001763979,0.001376842,0.0003656653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001621828,"about_ca_system_score_gemma":0.001681871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004176798,"about_ca_topic_score_gemma":0.00422119,"domain_scores_codex":[0.9988029,0.0005927626,0.00004591774,0.0001398256,0.0002708226,0.0001477118],"domain_scores_gemma":[0.9958119,0.003195919,0.0003520044,0.0002631325,0.0002441311,0.0001328564],"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.00006745477,0.00003141276,0.0005070712,0.00002411623,0.00003152244,0.00002931307,0.00003661535,0.9698511,0.0002742485,0.01810475,0.0003262508,0.0107161],"study_design_scores_gemma":[0.000005406394,0.00001044807,0.00002525683,0.000003404971,0.000001767198,0.000004203423,0.000003652132,0.9923624,0.0001074376,0.00740216,0.00007229393,0.000001542375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03652526,0.0001639977,0.9602805,0.0002153566,0.00001979739,0.00005618138,0.00003826644,0.0003406902,0.002359913],"genre_scores_gemma":[0.8417458,0.0001455726,0.1552438,0.0001791883,0.00003285521,0.0001941913,0.0001332532,0.0001153908,0.002209964],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004176798,"threshold_uncertainty_score":0.01515687,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.156201570884926,"score_gpt":0.4414865312104221,"score_spread":0.2852849603254962,"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."}}