Identifying Most Probable Negotiation Scenario in Bilateral Contracts with Reinforcement Learning

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper proposes an adaptation of the Q-Learning reinforcement learning algorithm, for the identification of the most probable scenario that a player may face, under different contexts, when negotiating bilateral contracts. For that purpose, the proposed methodology is integrated in a Decision Support System that is capable to generate several different scenarios for each negotiation context. With this complement, the tool can also identify the most probable scenario for the identified negotiation context. A realistic case study is conducted, based on real contracts data, which confirms the learning capabilities of the proposed methodology. It is possible to identify the most probable scenario for each context over the learned period. Nonetheless, the identified scenario might not always be the real negotiation scenario, given the variable nature of such negotiations. However, this work greatly reduces the frequency of such unexpected scenarios, contributing to a greater success of the supported player over time.

Cite

CITATION STYLE

APA

Silva, F., Pinto, T., Praça, I., & Vale, Z. (2019). Identifying Most Probable Negotiation Scenario in Bilateral Contracts with Reinforcement Learning. In Advances in Intelligent Systems and Computing (Vol. 930, pp. 556–571). Springer Verlag. https://doi.org/10.1007/978-3-030-16181-1_53

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free