ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2201.12224
  4. Cited By
Learning Stationary Nash Equilibrium Policies in $n$-Player Stochastic
  Games with Independent Chains
v1v2v3v4 (latest)

Learning Stationary Nash Equilibrium Policies in nnn-Player Stochastic Games with Independent Chains

SIAM Journal of Control and Optimization (SICON), 2022
28 January 2022
S. Rasoul Etesami
ArXiv (abs)PDFHTML

Papers citing "Learning Stationary Nash Equilibrium Policies in $n$-Player Stochastic Games with Independent Chains"

4 / 4 papers shown
Online Learning for Dynamic Vickrey-Clarke-Groves Mechanism in Unknown Environments
Online Learning for Dynamic Vickrey-Clarke-Groves Mechanism in Unknown Environments
Vincent Leon
S. Rasoul Etesami
208
0
0
23 Jun 2025
Fully Decentralized Cooperative Multi-Agent Reinforcement Learning: A
  Survey
Fully Decentralized Cooperative Multi-Agent Reinforcement Learning: A Survey
Jiechuan Jiang
Kefan Su
Zongqing Lu
272
8
0
10 Jan 2024
Scalable and Independent Learning of Nash Equilibrium Policies in
  $n$-Player Stochastic Games with Unknown Independent Chains
Scalable and Independent Learning of Nash Equilibrium Policies in nnn-Player Stochastic Games with Unknown Independent Chains
Tiancheng Qin
S. Rasoul Etesami
345
2
0
04 Dec 2023
Slowly Changing Adversarial Bandit Algorithms are Efficient for
  Discounted MDPs
Slowly Changing Adversarial Bandit Algorithms are Efficient for Discounted MDPsInternational Conference on Algorithmic Learning Theory (ALT), 2022
Ian A. Kash
L. Reyzin
Zishun Yu
476
1
0
18 May 2022
1
Page 1 of 1