• Corpus ID: 119160685

Stratified pooling games : an extension with optimized stock levels

@article{Schlicher2018StratifiedPG,
  title={Stratified pooling games : an extension with optimized stock levels},
  author={Loe Schlicher and Marco Slikker and Willem van Jaarsveld},
  journal={arXiv: Optimization and Control},
  year={2018},
  pages={1-24}
}
We consider a natural extension of stratified pooling games, by allowing players to optimize on the stock level of the joint spare parts pool as well. It is known that such type of extension can break the core non-emptiness result for spare parts pooling games. However, we are able to show core non-emptiness for our game. 
1 Citations

Core Nonemptiness of Stratified Pooling Games: A Structured Markov Decision Process Approach

A proof demonstrating that stratified pooling games always have a nonempty core is presented, which may be more generally applicable for other cooperative games where coalitional values can be defined in terms of Markov decision processes.

References

SHOWING 1-10 OF 10 REFERENCES

Stratified pooling versus full pooling: (non-) emptiness of the core

We study a situation with several service providers that are located geographically close together. These service providers keep spare parts in stock to protect for downtime of their high-tech

Inventory pooling games for expensive, low‐demand spare parts

We consider several independent decision makers who stock expensive, low‐demand spare parts for their high‐tech machines. They can collaborate by full pooling of their inventories via free

Probabilistic resource pooling games

A probabilistic resource pooling game that can be applied to a spare parts pooling situation and an intuitive class of allocation rules for which the resulting allocations are core members with an appealing fairness property are presented.

A Dual Description of the Class of Games with a Population Monotonic Allocation Scheme

This paper provides necessary and sufficient conditions to determine whether a TU-game has a population monotonic allocation scheme or not and shows that every four-person integer valued game with a population Monotonic allocations scheme has an integer valued population monOTonic allocation schemes.

Introduction to the Theory of Cooperative Games

"Introduction to the Theory of Cooperative Games" systematically studies the main solutions of cooperative games: the core, bargaining set, kernel, nucleolus, and the Shapley value of TU games, and

Applying a New Device in the Optimization of Exponential Queuing Systems

A new definition of the time of transition is provided, which is able to utilize the inductive approach in a manner characteristic of inventory theory, and a policy optimal for all sufficiently small discount factors can be obtained from the usual average cost functional equation without recourse to further computation.

Markov Decision Processes: Discrete Stochastic Dynamic Programming

  • M. Puterman
  • Computer Science
    Wiley Series in Probability and Statistics
  • 1994
Markov Decision Processes covers recent research advances in such areas as countable state space models with average reward criterion, constrained models, and models with risk sensitive optimality criteria, and explores several topics that have received little or no attention in other books.

A First Course in Probability and Markov Chains

This book looks at making use of measure theory notations that unify all the presentation, in particular avoiding the separate treatment of continuous and discrete distributions.