On the complexity of cooperative solution concepts
Mathematics of Operations Research
Complexity of the minimum base game on matroids
Mathematics of Operations Research
Complexity of determining nonemptiness of the core
Proceedings of the 4th ACM conference on Electronic commerce
Alert Correlation in a Cooperative Intrusion Detection Framework
SP '02 Proceedings of the 2002 IEEE Symposium on Security and Privacy
Secure or insure?: a game-theoretic analysis of information security games
Proceedings of the 17th international conference on World Wide Web
Coalitional Game Theory for Security Risk Management
ICIMP '10 Proceedings of the 2010 Fifth International Conference on Internet Monitoring and Protection
Distributed Coalition Formation Games for Secure Wireless Transmission
Mobile Networks and Applications
| Hi-index | 0.00 |
Coalition games have been recently used for modeling a variety of security problems. From securing the wireless transmissions in decentralized networks to employing effective intrusion detection systems in large organizations, cooperation among interested parties has shown to bring significant benefits. Motivating parties to abide to a solution is, however, a key problem in bridging the gap between theoretical models and practical solutions. Benefits should be distributed among players (wireless nodes in a network, different divisions of an organization in security riskmanagement, or organizations cooperating to fight spam), such that no group of players is motivated to break off and form a new coalition. This problem, referred to as core allocation, grows computationally very expensive with a large number of agents. In this paper, we present a novel approximate core allocation algorithm, called the bounding boxed core (BBC), for large cooperative security games in characteristic form that rely on superadditivity. The proposed algorithm is an anytime (an algorithm is called anytime if it can be interrupted at any time point during execution to return an answer whose value, at least in certain classes of stochastic processes, improves in expectation as a function of the computation time) algorithm based on iterative state space search for better solutions. Experimental results on a 25-player game, with roughly 34 million coalitions, show that BBC shrinks the 25-dimensional bounding-box to 10-15 times its initial hypervolume.