Towards Cooperation in Adversarial Search with Confidentiality

  • Branislav Bošanský
  • Viliam Lisý
  • Michal Pěchouček
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6867)


We investigate the problem of cooperation of self-interested agents with respect to the confidentiality of their plans and without a presence of any third-party mediator. We base our approach on non-zero-sum n-player games in the extensive form focusing on two main goals: (1) the analysis of the maximal improvement of the utility value that an agent can gain by negotiation, and (2) the dependence of this improvement on the basic characteristics of the game – the number of agents, size of the branching factor, and correlation of the utility functions. We provide theoretical definitions together with experimental results evaluated on games abstracting real-world scenarios.


Utility Function Game Tree Maximal Improvement Correlate Equilibrium Utility Improvement 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Weerdt, M.D., Mors, A.T., Witteveen, C.: Multi-agent planning: An introduction to planning and coordination. Technical report, In: Handouts of the European Agent Summer (2005)Google Scholar
  2. 2.
    Murray, C., Gordon, G.J.: Multi-robot negotiation: Approximating the set of subgame perfect equilibria in general-sum stochastic games. In: NIPS, pp. 1001–1008 (2006)Google Scholar
  3. 3.
    von Stengel, B., Forges, F.: Extensive-form correlated equilibrium: Definition and computational complexity. Math. Oper. Res. 33(4), 1002–1022 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    van der Krogt, R., de Weerdt, M., Zhang, Y.: Of mechanism design and multiagent planning. In: Proceedings of ECAI 2008, pp. 423–427 (2008)Google Scholar
  5. 5.
    Ma, J., Russo, A., Broda, K., Lupu, E.: Multi-agent planning with confidentiality. In: Proceedings of AAMAS 2009, pp. 1275–1276 (2009)Google Scholar
  6. 6.
    Luckhardt, C., Irani, K.B.: An algorithmic solution of n-person games. In: Proc. of the National Conference on Artificial Intelligence (AAAI 1986), pp. 158–162 (1986)Google Scholar
  7. 7.
    Shoham, Y., Leyton-Brown, K.: Multiagent systems: Algorithmic. In: Game-Theoretic, and Logical Foundations, pp. 1–532 (2009)Google Scholar
  8. 8.
    Sturtevant, N., Bowling, M.: Robust game play against unknown opponents. In: Proceedings of AAMAS 2006, pp. 713–719 (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Branislav Bošanský
    • 1
  • Viliam Lisý
    • 1
  • Michal Pěchouček
    • 1
  1. 1.Agent Technology Center, Dept. of Cybernetics, FEECzech Technical UniversityPrague 6Czech Republic

Personalised recommendations