Optimization problems, allocation problems, cooperative games, 91-02, 91A12, 90B30, 90B35, 90B10, 90B05,

In order to be able to devise successful strategies for destabilizing terrorist organizations it is vital to recognize and understand their structural properties. This paper deals with the optimal communication structure of terrorist organizations when considering the tradeoff between secrecy and operational efficiency. We use elements from game theory and graph theory to determine the 'optimal' communication structure a covert network should adopt. Every covert organization faces the constant dilemma of staying secret and ensuring the necessary coordination between its members. For several different secrecy and information scenarios this dilemma is modeled as a game theoretic bargaining problem over the set of connected graphs of given order. Assuming uniform exposure probability of individuals in the network we show that the Nash bargaining solution corresponds to either a network with a central individual (the star graph) or an all-to-all network (the complete graph) depending on the link detection probability, which is the probability that communication between individuals will be detected. If the probability that an individual is exposed as member of the network depends on the information hierarchy determined by the structure of the graph, the Nash bargaining solution corresponds to cellular-like networks.

No abstract

No abstract

On some balanced, totally balanced and submodular delivery games Granot, D.; Hamers, Herbert; Tijs, S.H.

No abstract

This paper considers sequencing situations with due date criteria. Three di erent t ypes of criteria are considered: the weighted penalty criterion, the weighted tardiness criterion and the completion time criterion. The main focus is on convexity of the associated cooperative games.

No abstract