The Sample Complexity of Online Strategic Decision Making with Information Asymmetry and Knowledge Transportability

Information asymmetry is a pervasive feature of multi-agent systems, especially evident in economics and social sciences. In these settings, agents tailor their actions based on private information to maximize their rewards. These strategic behaviors often introduce complexities due to confounding variables. Simultaneously, knowledge transportability poses another significant challenge, arising from the difficulties of conducting experiments in target environments. It requires transferring knowledge from environments where empirical data is more readily available. Against these backdrops, this paper explores a fundamental question in online learning: Can we employ non-i.i.d. actions to learn about confounders even when requiring knowledge transfer? We present a sample-efficient algorithm designed to accurately identify system dynamics under information asymmetry and to navigate the challenges of knowledge transfer effectively in reinforcement learning, framed within an online strategic interaction model. Our method provably achieves learning of an $\epsilon$-optimal policy with a tight sample complexity of $O(1/\epsilon^2)$.

@article{hu2025_2506.09940,
  title={ The Sample Complexity of Online Strategic Decision Making with Information Asymmetry and Knowledge Transportability },
  author={ Jiachen Hu and Rui Ai and Han Zhong and Xiaoyu Chen and Liwei Wang and Zhaoran Wang and Zhuoran Yang },
  journal={arXiv preprint arXiv:2506.09940},
  year={ 2025 }
}