z-logo
open-access-imgOpen Access
Supplier Competition with Option Contracts for Discrete Blocks of Capacity
Author(s) -
Edward Anderson,
Bo Chen,
Lusheng Shao
Publication year - 2017
Publication title -
operations research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.797
H-Index - 140
eISSN - 1526-5463
pISSN - 0030-364X
DOI - 10.1287/opre.2017.1593
Subject(s) - reservation , competition (biology) , computer science , set (abstract data type) , microeconomics , payment , reservation price , mathematical optimization , operations research , business , economics , mathematics , computer network , ecology , world wide web , biology , programming language
When a firm faces an uncertain demand, it is common to procure supply usingsome type of option in addition to spot purchases. A typical version of this probleminvolves capacity being purchased in advance, with a separate payment made that appliesonly to the part of the capacity that is needed. We consider a discrete version of thisproblem in which competing suppliers choose a reservation price and an execution pricefor blocks of capacity, and the buyer, facing known distributions of demand and spot price,needs to decide which blocks to reserve. We show how to solve the buyer’s (combinatorial)problem efficiently and also show that suppliers can do no better than offer blocks atexecution prices that match their costs, making profits only from the reservation part oftheir bids. Finally we show that in an equilibrium the buyer selects the welfare maximizingset of blocks.Restricted Access: Metadata Onl

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom