Showing 1 - 10 of 39
This paper introduces fixed tree games with repeated players (FRP games) which are a generalization of standard fixed … tree games.This generalization consists in allowing players to be located in more than one vertex.As a consequence, these … players can choose among several ways of connection with the root.In this paper we show that FRP games are balanced …
Persistent link: https://www.econbiz.de/10011092282
All over the world intelligence services are collecting data concerning possible terrorist threats. This information is usually transformed into network structures in which the nodes represent the individuals in the data set and the links possible connections between these individuals....
Persistent link: https://www.econbiz.de/10011144438
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/10011092639
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 introduces a framework for joint hub network development. Building a joint physical hub for transhipment of goods is expensive and therefore involves considerable risks for the cooperating companies. In a practical setting, it is unlikely that an entire network will be built at once....
Persistent link: https://www.econbiz.de/10011092677
situations with a single batch machine and analyze cooperative games arising from these situations. It is shown that these games … are convex and an expression for the Shapley value of these games is provided. We also introduce an equal gain splitting …
Persistent link: https://www.econbiz.de/10011092696
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/10011092700
convexity of the associated cooperative games. …
Persistent link: https://www.econbiz.de/10011092827
object is owned by a different agent, Shapley and Shubik (1972) introduced a class of assignment games arising from these … simple assignment games and relaxations that arise from assignment situations with multiple ownership.First, necessary and ….Second, balancedness results are obtained for relaxations of simple assignment games. …
Persistent link: https://www.econbiz.de/10011090430
The class of neighbour games is the intersection of the class of assignment games (cf. Shapley and Shubik (1972)) and … the class of component additive games (cf. Curiel et al. (1994)). For assignment games and component additive games there … paper we present a polynomially bounded algorithm of order p2 for calculating the nucleolus of neighbour games. …
Persistent link: https://www.econbiz.de/10011090443