2014
DOI: 10.1016/j.orl.2013.12.005
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic cost allocation for economic lot sizing games

Abstract: We consider a cooperative game defined by an economic lot sizing problem with concave ordering costs over a finite time horizon, in which each player faces demand for a single product in each period and coalitions can pool orders. We show how to compute a dynamic cost allocation in the strong sequential core of this game, i.e. an allocation over time that exactly distributes costs and is stable against coalitional defections at every period of the time horizon.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
4
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(4 citation statements)
references
References 11 publications
0
4
0
Order By: Relevance
“…Specifically, they prove that there exists an optimal dual solution that defines an allocation in the core and point out that it is not necessarily true that every optimal dual solution defines a core allocation. Toriello and Uhan (2014) also study ELS-games with general concave ordering costs and show how to compute a dynamic cost allocation in the strong sequential core of these games, i.e., an allocation over time that exactly distributes costs and is stable against coalitional defections at every period of the time horizon.…”
Section: Introductionmentioning
confidence: 99%
“…Specifically, they prove that there exists an optimal dual solution that defines an allocation in the core and point out that it is not necessarily true that every optimal dual solution defines a core allocation. Toriello and Uhan (2014) also study ELS-games with general concave ordering costs and show how to compute a dynamic cost allocation in the strong sequential core of these games, i.e., an allocation over time that exactly distributes costs and is stable against coalitional defections at every period of the time horizon.…”
Section: Introductionmentioning
confidence: 99%
“…The core as a solution to a cooperative game has the advantage that any imputation from it is undominated. This solution is quite popular in the literature on the application of dynamic game theory, not only because of the aforementioned property, but also because of its flexibility, allowing allocating the cooperative outcome in several ways, for instance, in lot sizing [3][4][5], pollution control [6][7][8], or non-renewable resource extraction [9]. In cooperative dynamic games, there is a known transformation of a characteristic function, which is a key component of any cooperative game measuring the claims of any group of players [10,11].…”
Section: Introductionmentioning
confidence: 99%
“…It holds that Proof. By the definition of the limiting characteristic function (5), we note that v t and vt are monotone. Taking into account their difference, it holds that v t − vt is monotone as well.…”
mentioning
confidence: 99%
“…The topic of this study falls into a stream of recent research on applying cooperative game theory in the area of inventory management; see, for instance, Anily and Haviv (2007), Chen (2009), Chen and Zhang (2009), Dror and Hartman (2007), Müller et al (2002), and Zhang (2009) for detailed discussions on inventory games. After the first appearance of our study, Gopaladesikan et al (2012) and Toriello and Uhan (2014), building upon some structural properties established here, propose primal‐dual algorithms for computing a core allocation, and develop cost allocations in the strong sequential core for economic lot‐sizing games without backlogging, respectively.…”
Section: Introductionmentioning
confidence: 99%