arXiv:2505.15490
공식 코드 · Papers with Code
Collaborative Problem-Solving in an Optimization Game
원문 초록
Dialogue agents that support human users in solving complex tasks have received much attention recently. Many such tasks are NP-hard optimization problems that require careful collaborative exploration of the solution space. We introduce a novel dialogue game in which the agents collaboratively solve a two-player Traveling Salesman problem, along with an agent that combines LLM prompting with symbolic mechanisms for state tracking and grounding. Our best agent solves 45% of games optimally in self-play. It also demonstrates an ability to collaborate successfully with human users and generalize to unfamiliar graphs.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Destroy and Repair Using Hyper Graphs for Routing
Blackout DIFUSCO
An Efficient Diffusion-based Non-Autoregressive Solver for Traveling Salesman Problem
DualOpt: A Dual Divide-and-Optimize Algorithm for the Large-scale Traveling Salesman Problem
ELENA: Epigenetic Learning through Evolved Neural Adaptation
Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problems
토론
이 논문과 연결된 포럼 글이 아직 없습니다.