A generalized linear production model: A unifying model
Mathematical Programming: Series A and B
On the core of network synthesis games
Mathematical Programming: Series A and B
On the complexity of cooperative solution concepts
Mathematics of Operations Research
On the complexity of testing membership in the core of min-cost spanning tree games
International Journal of Game Theory
A simulation-based approach to two-stage stochastic programming with recourse
Mathematical Programming: Series A and B
A General Framework for the Study of Decentralized Distribution Systems
Manufacturing & Service Operations Management
A Three-Stage Model for a Decentralized Distribution System of Retailers
Operations Research
Cooperative facility location games
Journal of Algorithms - Special issue: SODA 2000
Mathematical Programming: Series A and B
Stable Farsighted Coalitions in Competitive Markets
Management Science
Shipment Consolidation: Who Pays for It and How Much?
Management Science
Cooperation Between Multiple Newsvendors with Warehouses
Manufacturing & Service Operations Management
Cost Allocation for Joint Replenishment Models
Operations Research
Inventory Centralization Games with Price-Dependent Demand and Quantity Discount
Operations Research
A Cost-Sharing Method for the Soft-Capacitated Economic Lot-Sizing Game
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Inventory Centralization Games with Price-Dependent Demand and Quantity Discount
Operations Research
Transshipment prices and pair-wise stability in coordinating the decentralized transshipment problem
Proceedings of the Behavioral and Quantitative Game Theory: Conference on Future Directions
Capacity Allocation and Scheduling in Supply Chains
Operations Research
The equivalence of uniform and Shapley value-based cost allocations in a specific game
Operations Research Letters
Hi-index | 0.00 |
In this paper, we present a unified approach to study a class of cooperative games arising from inventory centralization. The optimization problems corresponding to the inventory games are formulated as stochastic programs. We observe that the strong duality of stochastic linear programming not only directly leads to a series of recent results concerning the nonemptiness of the core of such games, but also suggests a way to find an element in the core. The proposed approach is also applied to inventory games with concave ordering cost. In particular, we show that the newsvendor game with concave ordering cost has a nonempty core. Finally, we prove that it is NP-hard to determine whether a given allocation is in the core of the inventory games even in a very simple setting.