arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2112.15331cs.CLcs.CY

Using Graph-Aware Reinforcement Learning to Identify Winning Strategies in Diplomacy Games (Student Abstract)

Indian Institute of Technology Ropar(印度理工学院罗帕尔分校);Carnegie Mellon University(卡内基梅隆大学);National University of Singapore(新加坡国立大学)

Hansin Ahuja, Lynnette Hui Xian Ng, Kokil Jaidka

英文摘要:

This abstract proposes an approach towards goal-oriented modeling of the detection and modeling complex social phenomena in multiparty discourse in an online political strategy game. We developed a two-tier approach that first encodes sociolinguistic behavior as linguistic features then use reinforcement learning to estimate the advantage afforded to any player. In the first tier, sociolinguistic behavior, such as Friendship and Reasoning, that speakers use to influence others are encoded as linguistic features to identify the persuasive strategies applied by each player in simultaneous two-party dialogues. In the second tier, a reinforcement learning approach is used to estimate a graph-aware reward function to quantify the advantage afforded to each player based on their standing in this multiparty setup. We apply this technique to the game Diplomacy, using a dataset comprising of over 15,000 messages exchanged between 78 users. Our graph-aware approach shows robust performance compared to a context-agnostic setup.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑