Predicting Decisions of AI Agents from Limited Interaction through Text-Tabular Modeling
Eilam Shapira, Moshe Tennenholtz, Roi Reichart

TL;DR
This paper introduces a text-tabular modeling approach using LLMs to predict AI agents' decisions in negotiation games from limited interactions, outperforming baseline methods.
Contribution
It presents a novel target-adaptive text-tabular prediction framework that leverages hidden LLM representations to improve decision prediction in AI negotiation scenarios.
Findings
Observer features improve response prediction accuracy by 4 points in AUC.
The model reduces bargaining offer prediction error by 14%.
The approach outperforms direct LLM prompting and baseline features.
Abstract
AI agents negotiate and transact in natural language with unfamiliar counterparts: a buyer bot facing an unknown seller, or a procurement assistant negotiating with a supplier. In such interactions, the counterpart's LLM, prompts, control logic, and rule-based fallbacks are hidden, while each decision can have monetary consequences. We ask whether an agent can predict an unfamiliar counterpart's next decision from a few interactions. To avoid real-world logging confounds, we study this problem in controlled bargaining and negotiation games, formulating it as target-adaptive text-tabular prediction: each decision point is a table row combining structured game state, offer history, and dialogue, while previous games of the same target agent, i.e., the counterpart being modeled, are provided in the prompt as labeled adaptation examples. Our model is built on a tabular foundation model…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
