paper-with-me

홈 › Papers

Matching Game Preferences Through Dialogical Large Language Models: A Perspective

2025-07-26 · Renaud Fabre, Daniel Egret, Patrice Bellot arxiv

This perspective paper explores the future potential of "conversational intelligence" by examining how Large Language Models (LLMs) could be combined with GRAPHYP's network system to better understand human conversations and preferences. Using recent research and case studies, we propose a conceptual framework that could make AI rea-soning transparent and traceable, allowing humans to see and understand how AI reaches its conclusions. We present the conceptual perspective of "Matching Game Preferences through Dialogical Large Language Models (D-LLMs)," a proposed system that would allow multiple users to share their different preferences through structured conversations. This approach envisions personalizing LLMs by embedding individual user preferences directly into how the model makes decisions. The proposed D-LLM framework would require three main components: (1) reasoning processes that could analyze different search experiences and guide performance, (2) classification systems that would identify user preference patterns, and (3) dialogue approaches that could help humans resolve conflicting information. This perspective framework aims to create an interpretable AI system where users could examine, understand, and combine the different human preferences that influence AI responses, detected through GRAPHYP's search experience networks. The goal of this perspective is to envision AI systems that would not only provide answers but also show users how those answers were reached, making artificial intelligence more transparent and trustworthy for human decision-making.

📄 PDF Abstract BibTeX arXiv:2507.20000

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Fundamental Limits of Game-Theoretic LLM Alignment: Smith Consistency and Preference Matching

2025-05-27 · Zhekun Shi, Kaizhao Liu, Qi Long, Weijie J. Su 외

Nash Learning from Human Feedback is a game-theoretic framework for aligning large language models (LLMs) with human preferences by modeling learning as a two-player zero-sum game. However, using raw preference as the pa…

Diversity

Decentralized and Uncoordinated Learning of Stable Matchings: A Game-Theoretic Approach

2024-07-31 · S. Rasoul Etesami, R. Srikant

We consider the problem of learning stable matchings with unknown preferences in a decentralized and uncoordinated manner, where "decentralized" means that players make decisions individually without the influence of a c…

Putting Gale & Shapley to Work: Guaranteeing Stability Through Learning

2024-10-06 · Hadi Hosseini, Sanjukta Roy, Duohan Zhang

Two-sided matching markets describe a large class of problems wherein participants from one side of the market must be matched to those from the other side according to their preferences. In many real-world applications …

Weak Monotone Comparative Statics

2019-11-15 · Yeon-Koo Che, Jinwoo Kim, Fuhito Kojima

We develop a theory of monotone comparative statics based on weak set order -- in short, weak monotone comparative statics -- and identify the enabling conditions in the context of individual choices, Pareto optimal choi…

Logical Semantics, Dialogical Argumentation, and Textual Entailment

2020-08-17 · Davide Catta, Richard Moot, Christian Retoré

In this chapter, we introduce a new dialogical system for first order classical logic which is close to natural language argumentation, and we prove its completeness with respect to usual classical validity. We combine o…

Natural Language InferenceSentence