Showing 1 - 10 of 43
In this paper we study a class of cooperative sequencing games that arise from one-machine sequencing situations in which chain precedence relations are imposed on the jobs. It is shown that these sequencing games are convex.
Persistent link: https://www.econbiz.de/10005572226
This paper introduces cooperative games arising from multi-depot Chinese postman problems and explores the properties of these games. A multi-depot Chinese postman problem (MDCP) is represented by a connected (di)graph G, a set of k depots that is a subset of the vertices of G, and a...
Persistent link: https://www.econbiz.de/10010818968
This paper analyses Chinese postman games with repeated players, which generalize Chinese postman games by dropping the one-to-one relation between edges and players. In our model, we allow players to own more than one edge, but each edge belongs to at most one player. The one-to-one relation...
Persistent link: https://www.econbiz.de/10011932352
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/10005582663
The core cover of a TU-game is a superset of the core and equals the convex hull of its larginal vectors. A larginal vector corresponds to an ordering of the players and describes the efficient payoff vector giving the first players in the ordering their utopia demand as long as it is still...
Persistent link: https://www.econbiz.de/10010593461
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/10010547353
The identification of key players in a terrorist network can lead to prevention of attacks, due to efficient allocation of surveillance means or isolation of key players in order to destabilize the network. In this paper we introduce a game theoretic approach to identify key players in terrorist...
Persistent link: https://www.econbiz.de/10014177191
The core cover of a TU-game is a superset of the core and equals the convex hull of its larginal vectors. A larginal vector corresponds to an order of the players and describes the efficient payoff vector giving the first players in the order their utopia demand as long as it is still possible...
Persistent link: https://www.econbiz.de/10014181798
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 networks...
Persistent link: https://www.econbiz.de/10014040501
The research that studies the interaction between sequencing situations and cooperative games, that started with the paper of Curiel et al. (1989), has become an established line of research. This paper introduces a new model in this field: partitioning sequencing situations and games. The...
Persistent link: https://www.econbiz.de/10014049861