Curiosity-Aware Bargaining
Opponent modeling consists in modeling the strategy or preferences of an agent thanks to the data it provides. In the context of automated negotiation and with machine learning, it can result in an advantage so overwhelming that it may restrain some casual agents to be part of the bargaining process. We qualify as "curious" an agent driven by the desire of negotiating in order to collect information and improve its opponent model. However, neither curiosity-based rational-ity nor curiosity-robust protocol have been studied in automatic negotiation. In this paper, we rely on mechanism design to propose three extensions of the standard bargaining protocol that limit information leak. Those extensions are supported by an enhanced rationality model, that considers the exchanged information. Also, they are theoretically analyzed and experimentally evaluated.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
LLM Agents for Bargaining with Utility-based Feedback
Bargaining, a critical aspect of real-world interactions, presents challenges for large language models (LLMs) due to limitations in strategic depth and adaptation to complex human factors. Existing benchmarks often fail…
In-Context LearningBargain your share: The role of workers bargaining power for labor share, with reference to transition economies
The objective of the paper is to understand the role of workers bargaining for the labor share in transition economies. We rely on a share-capital schedule, whereby workers bargaining power is represented as a move off t…
MERIT Feedback Elicits Better Bargaining in LLM Negotiators
Bargaining is often regarded as a logical arena rather than an art or a matter of intuition, yet Large Language Models (LLMs) still struggle to navigate it due to limited strategic depth and difficulty adapting to comple…
What killed the cat? Towards a logical formalization of curiosity (and suspense, and surprise) in narratives
We provide a unified framework in which the three emotions at the heart of narrative tension (curiosity, suspense and surprise) are formalized. This framework is built on nonmonotonic reasoning which allows us to compact…
Fairness-Aware Meta-Learning via Nash Bargaining
To address issues of group-level fairness in machine learning, it is natural to adjust model parameters based on specific fairness objectives over a sensitive-attributed validation set. Such an adjustment procedure can b…
Fairnessimage-classificationImage ClassificationMeta-Learning+1