Indirect Dynamic Negotiation in the Nash Demand Game
Not on the map. Why?
Abstract (arXiv)
The paper addresses a problem of sequential bilateral bargaining with incomplete information. We proposed a decision model that helps agents to successfully bargain by performing indirect negotiation and learning the opponent's model. Methodologically the paper casts heuristically-motivated bargaining of a self-interested independent player into a framework of Bayesian learning and Markov decision processes. The special form of the reward implicitly motivates the players to negotiate indirectly, via closed-loop interaction. We illustrate the approach by applying our model to the Nash demand game, which is an abstract model of bargaining. The results indicate that the established negotiation: i) leads to coordinating players' actions; ii) results in maximising success rate of the game and iii) brings more individual profit to the players.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 3 of its 66 references that are in the map. First posted on arXiv 10 Sep 2024.
Builds on
3 of 66 references.
References · 3
Built on by
Not cited yet.