1. Capacity Games with Supply Function Competition
- Author
-
Bo Chen, Lusheng Shao, and Edward Anderson
- Subjects
FOS: Computer and information sciences ,Technology ,capacity game ,Operations Research ,DEMAND ,HB ,Social Sciences ,90B50, 91A10 ,Management Science and Operations Research ,ELECTRICITY ,Nash equilibrium ,Computer Science - Computer Science and Game Theory ,Business & Economics ,0102 Applied Mathematics ,FOS: Mathematics ,Mathematics - Optimization and Control ,0802 Computation Theory and Mathematics ,Science & Technology ,Operations Research & Management Science ,option contract ,Management ,Computer Science Applications ,submodularity ,Optimization and Control (math.OC) ,1503 Business and Management ,H1 ,supply function ,AUCTIONS ,Computer Science and Game Theory (cs.GT) - Abstract
This paper studies a setting in which multiple suppliers compete for a buyer's procurement business. The buyer faces uncertain demand and there is a requirement to reserve capacity in advance of knowing the demand. Each supplier has costs that are two dimensional, with some costs incurred before demand is realized in order to reserve capacity and some costs incurred after demand is realized at the time of delivery. A distinctive feature of our model is that the marginal costs may not be constants, and this naturally leads us to a supply function competition framework in which each supplier offers a schedule of prices and quantities. We treat this problem as an example of a general class of capacity games and show that, when the optimal supply chain profit is submodular, in equilibrium the buyer makes a reservation choice that maximizes the overall supply chain profit, each supplier makes a profit equal to their marginal contribution to the supply chain, and the buyer takes the remaining profit. We further prove that this submodularity property holds under two commonly studied settings: (1) there are only two suppliers; and (2) in the case of more than two suppliers, the marginal two-dimension costs of each supplier are non-decreasing and constant, respectively., Comment: 35 pages
- Published
- 2022
- Full Text
- View/download PDF