In this paper, we present a unified approach to study a class of cooperative games arisingfrom 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...

We consider the economic lot-sizing (ELS) game with general concave ordering cost.In this cooperative game, multiple retailers form a coalition by placing joint orders to asingle supplier in order to reduce ordering cost. When both the inventory holding costand backlogging cost are linear...

The generalized assignment problem (GAP) examines the maximum profit assignment of jobs to processors such that each job is assigned to precisely one processor subject to capacity restrictions on the processors. Due to the fact that the GAP is an NP-hard integer program dual prices are not...

The multiple-choice nested knapsack problem (MCKP) is a generalization of the ordinary knapsack problem, where the set of items is partitioned into classes. The binary choice of selecting an item is replaced by taking exactly one item out of each class of items. Due to the fact that the MCKP is...

In combinatorial auctions the pricing problem is of main concern since it is the means by which the auctioneer signals the result of the auction to the participants. In order for the auction to be regarded as fair among the various participants the price signals should be such that a participant...

Combinatorial auctions permitting bids on bundles of items have been developed to remedy the exposure problem associated with single-item auctions. Given winning bundle prices a set of item prices is called market clearing or equilibrium if all the winning bids are greater than or equal and if...