Core Allocations for Cooperation Problems in Vaccination

Vaccination is a very effective measure to fight an outbreak of an infectious disease, but it often suffers from delayed deliveries and limited stockpiles. To use these limited doses of vaccine effectively, health agencies can decide to cooperate and share their doses. In this study, we analyze this type of cooperation. Typically cooperation leads to an increased total return, but cooperation is only plausible when this total return can be distributed in a stable way. This makes cooperation a delicate matter. Using cooperative game theory, we derive theoretical sufficient conditions under which cooperation is plausible (i.e., the core is non-empty) and we show that the doses of vaccine can be traded for a market price in those cases. We perform numerical analyses to generalize these findings and we derive analytical expressions for market prices that can be used in general for distributing the total return. Our results demonstrate that cooperation is most likely to be plausible in case of severe shortages and in case of sufficient supply, with possible mismatches between supply and demand. In those cases, trading doses of vaccine for a market price often results in a core allocation of the total return. We confirm these findings with a case study on the redistribution of influenza vaccines

Resource location games

In this paper, we introduce and analyze resource location games. We show core nonemptiness by providing a set of intuitive core allocations, called Resource-Profit allocations. In addition, we present a sufficient condition for which the core and the set of Resource- Profit allocations coincide. Finally, we provide an example showing that when the sufficient condition is not satisfied, the coincidence is not guaranteed

Three-valued simple games

textabstractIn this paper we study three-valued simple games as a natural extension of simple games. We analyze to which extent well-known results on the core and the Shapley value for simple games can be extended to this new setting. To describe the core of a three-valued simple game we introduce (primary and secondary) vital players, in analogy to veto players for simple games. Moreover, it is seen that the transfer property of Dubey (1975) can still be used to characterize the Shapley value for three-valued simple games. We illustrate three-valued simple games and the corresponding Shapley value in a parliamentary bicameral system

On the Convexity of Step Out Step in Sequencing Games

The main result of this paper is the convexity of Step out - Step in (SoSi) sequencing games, a class of relaxed sequencing games first analyzed by Musegaas, Borm, and Quant (2015). The proof makes use of a polynomial time algorithm determining the value and an optimal processing order for an arbitrary coalition in a SoSi sequencing game. In particular, we use that in determining an optimal processing order of a coalition S [ fig, the algorithm can start from the optimal processing order found for coalition S and thus all information on this optimal processing order of S can be used