Approximating Constraint-Based Utility Spaces Using Generalized Gaussian Mixture Models
원문 초록
Complex negotiations are characterized by a particular type of utility spaces that is usually non-linear and non-monotonic. An example of such utility spaces are constraint-based utility spaces. The multitude of constraints’ shapes that could potentially be used by the negotiating agents makes any opponent modeling attempt more challenging. The same problem persists even when the agent is exploring her own utility space as to find her optimal contracts. Seeking a unified form for constraint-based utility representation might shed some light on how to tackle these problems. In this paper, we propose to find an approximation for constraint-based preferences, used mainly in complex negotiation with non-linear utility spaces. The proposed approximation yields a compact form that unifies a whole family of constraints (Cubic, Bell, Conic, etc.). Results show that the new canonical form can in fact be an alternative representation for all known constraint-based utility functions. Additionally, it leads us to a potential parametric model that could be used for opponent modeling in complex non-linear negotiations.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Writing-RL: Advancing Long-form Writing via Adaptive Curriculum Reinforcement Learning
SuperWriter: Reflection-Driven Long-Form Generation with Large Language Models
How Does Response Length Affect Long-Form Factuality
MedScore: Factuality Evaluation of Free-Form Medical Answers
Frankentext: Stitching random text fragments into long-form narratives
Teaching Large Language Models to Maintain Contextual Faithfulness via Synthetic Tasks and Reinforcement Learning
토론
이 논문과 연결된 포럼 글이 아직 없습니다.