2026-09-25
The concealing conceder: Minimizing the information revealed by concessions in automated negotiation
Publication
Publication
A negotiating party may want to conceal their preferences to avoid exploitation by the opponent. To achieve this goal, a possible strategy is to limit the amount of information that is revealed by the offers proposed in a negotiation. In this paper, we define which and how much information is disclosed by offers and we present two methods to conceal preferences from the opponent. We show a method that, given the number of offers, gives a sequence of offers that minimizes the increase in revealed information. Additionally, we present a method that, given specific information that may be revealed, gives a sequence of offers that reveals only such information, and we prove guarantees on the length of this sequence. Our experiments show that both methods outperform baseline strategies based on random sampling, and that the methods even match optimal sequences in terms of revealed information.
| Additional Metadata | |
|---|---|
| , , , | |
| doi.org/10.1007/978-3-032-39395-1_17 | |
| Lecture Notes in Computer Science | |
| 23rd European Conference, EUMAS 2026 | |
| Organisation | Intelligent and autonomous systems |
|
Peters, L., Hojny, C.& Baarslag, T. (2026). The concealing conceder: Minimizing the information revealed by concessions in automated negotiation. Multi-Agent Systems, Proceedings of the 23rd European Conference, EUMAS 2026, 16829.https://doi.org/10.1007/978-3-032-39395-1_17 |
|