Showing 1 - 10 of 11
We consider the allocation of a finite number of indivisible objects to the same number of agents according to an exogenously given queue.We assume that the agents collaborate in order to achieve an efficient outcome for society.We allow for side-payments and provide a method for obtaining...
Persistent link: https://www.econbiz.de/10011092641
This paper shows that some classes of relaxed sequencing games, which arise from the class of sequencing games as introduced in Curiel, Pederzoli, Tijs (1989), are balanced.
Persistent link: https://www.econbiz.de/10011092704
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 …
Persistent link: https://www.econbiz.de/10011092758
In this paper we introduce multiple longest traveling salesman (MLTS) games. An MLTS game arises from a network in which a salesman has to visit each node (player) precisely once, except its home location, in an order that maximizes the total reward.First it is shown that the value of a...
Persistent link: https://www.econbiz.de/10011090530
In this paper we study the relation between convexity of TU games and marginal vectors.We show that if specfic marginal vectors are core elements, then the game is convex.We characterize sets of marginal vectors satisfying this property, and we derive the formula for the minimum number of...
Persistent link: https://www.econbiz.de/10011091198
Abstract: Lindelauf et al. (2009a) introduced a quantitative approach to investigate optimal structures of covert networks. This approach used an objective function which is based on the secrecy versus information trade-off these organizations face. Sageman (2008) hypothesized that covert...
Persistent link: https://www.econbiz.de/10011091475
Covert organizations are constantly faced with a tradeoff between secrecy and operational efficiency. Lindelauf, Borm and Hamers (2008) developed a theoretical framework to deter- mine optimal homogeneous networks taking the above mentioned considerations explicitly into account. In this paper...
Persistent link: https://www.econbiz.de/10011091539
Persistent link: https://www.econbiz.de/10011091682
In this paper we construct sets of marginal vectors of a TU game with the property that if the marginal vectors from these sets are core elements, then the game is convex.This approach leads to new upperbounds on the number of marginal vectors needed to characterize convexity.An other result is...
Persistent link: https://www.econbiz.de/10011091846
This paper considers one machine job scheduling situations or sequencing problems, where clients can have more than a single job to be processed in order to get a final output.Moreover, a job can be of interest for different players. This means that one of the main assumptions in classic...
Persistent link: https://www.econbiz.de/10011091902