Towards cooperation in adversarial search with confidentiality

Authors:
Branislav Bošanský;Viliam Lisý;Michal Pěchouček
Affiliations:
Agent Technology Center, Dept. of Cybernetics, FEE, Czech Technical University, Prague, Czech Republic;Agent Technology Center, Dept. of Cybernetics, FEE, Czech Technical University, Prague, Czech Republic;Agent Technology Center, Dept. of Cybernetics, FEE, Czech Technical University, Prague, Czech Republic
Venue:
HoloMAS'11 Proceedings of the 5th international conference on Industrial applications of holonic and multi-agent systems for manufacturing
Year:
2011

Citing 4
Cited 0

Robust game play against unknown opponents

AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations

Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations
Multi-agent planning with confidentiality

Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Of Mechanism Design Multiagent Planning

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

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-zerosum 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.