logo
today local_bar
🏛 Nanjing University of Posts and Telecommunications

6 papers across 2 sessions

Poster Session 4

4 papers
Thursday, December 4, 2025 · 4:30 PM → 7:30 PM
Exhibit Hall C,D,E
Last-Iterate Convergence of Smooth Regret Matching Variants in Learning Nash Equilibria
#3202 · Linjian Meng, Youzhi Zhang, Zhenxing Ge, Tianyu Ding, Shangdong Yang, Zheng Xu, Wenbin Li, Yang Gao

We investigate last-iterate convergence of Regret Matching$^+$ variants in games satisfying the weak Minty variation inequality.
In-Context Fully Decentralized Cooperative Multi-Agent Reinforcement Learning
#307 · Chao Li, Bingkun BAO, Yang Gao

This paper enhances the fully decentralized cooperative multi-agent reinforcement learning from a context modeling perspective.
Multi-Agent Reinforcement Learning with Communication-Constrained Priors
#309 · Guang Yang, Jingwen Qiao, Tianpei Yang, Yanqing Wu, Jing Huo, Xingguo Chen, Yang Gao
EconGym: A Scalable AI Testbed with Diverse Economic Tasks
#310 · Qirui Mi, Qipeng Yang, Zijun Fan, Wentian Fan, Heyang Ma, Chengdong Ma, Siyu Xia, Bo An, Jun Wang, Haifeng Zhang

Poster Session 5

2 papers
Friday, December 5, 2025 · 11:00 AM → 2:00 PM
Exhibit Hall C,D,E
Efficient Last-Iterate Convergence in Solving Extensive-Form Games
#2912 · Linjian Meng, Tianpei Yang, Youzhi Zhang, Zhenxing Ge, Shangdong Yang, Tianyu Ding, Wenbin Li, Bo An, Yang Gao

We present the first parameter-free last-iterate convergence of Counterfactual Regret Minimization algorithms.
Learning from Disjoint Views: A Contrastive Prototype Matching Network for Fully Incomplete Multi-View Clustering
#2507 · Yiming Wang, Qun Li, Dongxia Chang, Jie Wen, Hua Dai, Fu Xiao, Yao Zhao