Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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)
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)
von Stengel, B., Forges, F.: Extensive-form correlated equilibrium: Definition and computational complexity. Math. Oper. Res. 33(4), 1002–1022 (2008)
van der Krogt, R., de Weerdt, M., Zhang, Y.: Of mechanism design and multiagent planning. In: Proceedings of ECAI 2008, pp. 423–427 (2008)
Ma, J., Russo, A., Broda, K., Lupu, E.: Multi-agent planning with confidentiality. In: Proceedings of AAMAS 2009, pp. 1275–1276 (2009)
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)
Shoham, Y., Leyton-Brown, K.: Multiagent systems: Algorithmic. In: Game-Theoretic, and Logical Foundations, pp. 1–532 (2009)
Sturtevant, N., Bowling, M.: Robust game play against unknown opponents. In: Proceedings of AAMAS 2006, pp. 713–719 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bošanský, B., Lisý, V., Pěchouček, M. (2011). Towards Cooperation in Adversarial Search with Confidentiality. In: Mařík, V., Vrba, P., Leitão, P. (eds) Holonic and Multi-Agent Systems for Manufacturing. HoloMAS 2011. Lecture Notes in Computer Science(), vol 6867. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23181-0_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-23181-0_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23180-3
Online ISBN: 978-3-642-23181-0
eBook Packages: Computer ScienceComputer Science (R0)