z-logo
Premium
Pricing in a Transportation Station with Strategic Customers
Author(s) -
Manou Athanasia,
Canbolat Pelin G.,
Karaesmen Fikri
Publication year - 2017
Publication title -
production and operations management
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.279
H-Index - 110
eISSN - 1937-5956
pISSN - 1059-1478
DOI - 10.1111/poms.12706
Subject(s) - unobservable , computer science , profit (economics) , complete information , operations research , business , poisson process , service (business) , marketing , poisson distribution , microeconomics , economics , mathematics , statistics , econometrics
We consider a transportation station, where customers arrive according to a Poisson process, observe the delay information and the fee imposed by the administrator and decide whether to use the facility or not. A transportation facility visits the station according to a renewal process and serves all present customers at each visit. We assume that every customer maximizes her individual expected utility and the administrator is a profit maximizer. We model this situation as a two‐stage game among the customers and the administrator, where customer strategies depend on the level of delay information provided by the administrator. We consider three cases distinguished by the level of delay information: observable (the exact waiting time is announced), unobservable (no information is provided) and partially observable (the number of waiting customers is announced). In each case, we explore how the customer reward for service, the unit waiting cost, and the intervisit time distribution parameters affect the customer behavior and the fee imposed by the administrator. We then compare the three cases and show that the customers almost always prefer to know their exact waiting times whereas the administrator prefers to provide either no information or the exact waiting time depending on system parameters.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here