Playing Extensive Form Negotiation Games: A Tool-Based Analysis (Abstract)

  • Sujata Ghosh
  • Sumit Sourabh
  • Rineke Verbrugge
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6953)

Introduction

This paper reports the development of a simple tool, NEGEXT, written in the platform-independent Java language. NEGEXT has been constructed to aid real people doing actual negotiations, when the ways to negotiate are simply too many to be computed by a normal human mind. This toolkit will also help in planning one’s strategic moves in negotiation situations when the opponents’ possible moves can be approximated. Even though some visualization tools for extensive form game trees already exist, we believe we are the first to make a tree-based negotiation toolkit that incorporates the possibility of representing learning from game to game, by sequential and parallel composition (cf. [1]). Moreover, the toolkit has a model-checking component which computes whether and how an individual or a specific coalition can achieve a given objective.

Keywords

Simple Game Parallel Composition Simple Tool Game Tree Parallel Combination 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Ghosh, S., Ramanujam, R., Simon, S.E.: Playing extensive form games in parallel. In: Dix, J., Leite, J., Governatori, G., Jamroga, W. (eds.) CLIMA XI. LNCS, vol. 6245, pp. 153–170. Springer, Heidelberg (2010)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Sujata Ghosh
    • 1
  • Sumit Sourabh
    • 2
  • Rineke Verbrugge
    • 1
  1. 1.Department of Artificial IntelligenceUniversity of GroningenGroningenThe Netherlands
  2. 2.Department of Mathematics and StatisticsIndian Institute of TechnologyKanpurIndia

Personalised recommendations