activity
20182026
most citedOn the Complexity of Computing Markov Perfect Equilibrium in General-Sum Stochastic Games

30 citations · 115 across the 26 of their papers we have counts for

collaborators
Showing 2023Show all

5 papers · 1 filter

cs.GT2023★ 2 cited

A survey on algorithms for Nash equilibria in finite normal-form games

Hanyu Li, Wenhan Huang, Zhijian Duan +4

Nash equilibrium is one of the most influential solution concepts in game theory. With the development of computer science and artificial intelligence, there is an increasing deman…

cs.LG2023★ 1 cited

Ask more, know better: Reinforce-Learned Prompt Questions for Decision Making with Large Language Models

Xue Yan, Yan Song, Xinyu Cui +4

Large language models (LLMs) demonstrate their promise in tackling complicated practical challenges by combining action-based policies with chain of thought (CoT) reasoning. Having…

cs.LG2023★ 10 cited

ChessGPT: Bridging Policy Learning and Language Modeling

Xidong Feng, Yicheng Luo, Ziyan Wang +6

When solving decision-making tasks, humans typically depend on information from two key sources: (1) Historical policy data, which provides interaction replay from the environment,…

cs.MA2023

MANSA: Learning Fast and Slow in Multi-Agent Systems

David Mguni, Haojun Chen, Taher Jafferjee +7

In multi-agent reinforcement learning (MARL), independent learning (IL) often shows remarkable performance and easily scales with the number of agents. Yet, using IL can be ineffic…

cs.MA2023★ 2 cited

Ensemble Value Functions for Efficient Exploration in Multi-Agent Reinforcement Learning

Lukas Schäfer, Oliver Slumbers, Stephen McAleer +3

Multi-agent reinforcement learning (MARL) requires agents to explore within a vast joint action space to find joint actions that lead to coordination. Existing value-based MARL alg…