{"id":"W4394775968","doi":"10.48550/arxiv.2404.06516","title":"Convergence to Nash Equilibrium and No-regret Guarantee in (Markov) Potential Games","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Regret; Nash equilibrium; Mathematical optimization; Best response; Correlated equilibrium; Computer science; Sublinear function; Epsilon-equilibrium; Convergence (economics); Markov chain; Stackelberg competition; Markov decision process; Flexibility (engineering); Mathematical economics; Mathematics; Markov process; Game theory; Equilibrium selection; Repeated game; Economics; Statistics; Discrete mathematics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001568953,0.0004493076,0.0006838503,0.001459837,0.00008094298,0.000408959,0.00215604,0.0003785679,0.0005453353],"category_scores_gemma":[0.00124101,0.0004330406,0.0002384356,0.002074173,0.0004186157,0.0003729008,0.007428267,0.001276101,0.002360373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000278687,"about_ca_system_score_gemma":0.0003685936,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002406603,"about_ca_topic_score_gemma":0.0002158986,"domain_scores_codex":[0.9952278,0.0003351914,0.00055843,0.002425185,0.0007262318,0.0007271328],"domain_scores_gemma":[0.9969485,0.0006034766,0.0001838518,0.001371946,0.0005677819,0.0003244278],"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.002205905,0.0003961097,0.01782118,0.0004817135,0.0003780198,0.01314074,0.002042107,0.886158,0.002372586,0.009817934,0.04228671,0.02289902],"study_design_scores_gemma":[0.0009496717,0.0001883806,0.005605635,0.0003702878,0.00005546968,0.00002717205,0.0006957266,0.7101499,0.0004047202,0.2751499,0.005347722,0.001055414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9621145,0.0004466019,0.03103476,0.0004454232,0.002364691,0.0007575296,0.0001841586,0.0001199708,0.002532332],"genre_scores_gemma":[0.9755773,0.0002735084,0.0005139544,0.00007642157,0.0001779705,0.000003017763,0.000009532142,0.00003734828,0.02333097],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.265332,"threshold_uncertainty_score":0.9998121,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1261491593914093,"score_gpt":0.2994446837724387,"score_spread":0.1732955243810294,"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."}}