IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v81y1995i2p324-335.html
   My bibliography  Save this article

Stochastic choice hazard and incentives in a common service facility

Author

Listed:
  • Radhakrishnan, Suresh
  • Balachandran, Kashi R.

Abstract

No abstract is available for this item.

Suggested Citation

  • Radhakrishnan, Suresh & Balachandran, Kashi R., 1995. "Stochastic choice hazard and incentives in a common service facility," European Journal of Operational Research, Elsevier, vol. 81(2), pages 324-335, March.
  • Handle: RePEc:eee:ejores:v:81:y:1995:i:2:p:324-335
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(93)E0317-Q
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Uri Yechiali, 1971. "On Optimal Balking Rules and Toll Charges in the GI / M /1 Queuing Process," Operations Research, INFORMS, vol. 19(2), pages 349-370, April.
    2. Balachandran, K R & Schaefer, Mark E, 1979. "Class Dominance Characteristics at a Service Facility," Econometrica, Econometric Society, vol. 47(2), pages 515-519, March.
    3. Uri Yechiali, 1972. "Customers' Optimal Joining Rules for the GI/M/s Queue," Management Science, INFORMS, vol. 18(7), pages 434-443, March.
    4. Balachandran, K. R. & Schaefer, Mark E., 1980. "Public and private optimization at a service facility with approximate information on congestion," European Journal of Operational Research, Elsevier, vol. 4(3), pages 195-202, March.
    5. Naor, P, 1969. "The Regulation of Queue Size by Levying Tolls," Econometrica, Econometric Society, vol. 37(1), pages 15-24, January.
    6. E. Loehman & A. Whinston, 1974. "An Axiomatic Approach to Cost Allocation for Public Investment," Public Finance Review, , vol. 2(2), pages 236-250, April.
    7. Seungjin Whang, 1989. "Cost Allocation Revisited: An Optimality Result," Management Science, INFORMS, vol. 35(10), pages 1264-1273, October.
    8. Hanna Alperstein, 1988. "Note---Optimal Pricing Policy for the Service Facility Offering a Set of Priority Prices," Management Science, INFORMS, vol. 34(5), pages 666-671, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Balachandran, Kashi R. & Radhakrishnan, Suresh, 1996. "Cost of congestion, operational efficiency and management accounting," European Journal of Operational Research, Elsevier, vol. 89(2), pages 237-245, March.
    2. Shone, Rob & Knight, Vincent A. & Williams, Janet E., 2013. "Comparisons between observable and unobservable M/M/1 queues with respect to optimal customer behavior," European Journal of Operational Research, Elsevier, vol. 227(1), pages 133-141.
    3. van Ackere, Ann, 1996. "The management of congestion," European Journal of Operational Research, Elsevier, vol. 89(2), pages 223-225, March.
    4. Hanukov, Gabi & Avinadav, Tal & Chernonog, Tatyana & Yechiali, Uri, 2020. "A service system with perishable products where customers are either fastidious or strategic," International Journal of Production Economics, Elsevier, vol. 228(C).
    5. Tingliang Huang & Gad Allon & Achal Bassamboo, 2013. "Bounded Rationality in Service Systems," Manufacturing & Service Operations Management, INFORMS, vol. 15(2), pages 263-279, May.
    6. Zhang, Zhe George & Yin, Xiaoling, 2021. "Information and pricing effects in two-tier public service systems," International Journal of Production Economics, Elsevier, vol. 231(C).
    7. Shiliang Cui & Xuanming Su & Senthil Veeraraghavan, 2019. "A Model of Rational Retrials in Queues," Operations Research, INFORMS, vol. 67(6), pages 1699-1718, November.
    8. Ghosh, Souvik & Hassin, Refael, 2021. "Inefficiency in stochastic queueing systems with strategic customers," European Journal of Operational Research, Elsevier, vol. 295(1), pages 1-11.
    9. Radhakrishnan, Suresh & Balachandran, Kashi R., 2004. "Service capacity decision and incentive compatible cost allocation for reporting usage forecasts," European Journal of Operational Research, Elsevier, vol. 157(1), pages 180-195, August.
    10. Sumita, Ushio & Masuda, Yasushi & Yamakawa, Shigetaka, 2001. "Optimal internal pricing and capacity planning for service facility with finite buffer," European Journal of Operational Research, Elsevier, vol. 128(1), pages 192-205, January.
    11. Lan Lu & Zheng Zhu & Pengfei Guo & Qiao‐Chu He, 2022. "Service Operations for Mixed Autonomous Paradigm: Lane Design and Subsidy," Production and Operations Management, Production and Operations Management Society, vol. 31(4), pages 1595-1612, April.
    12. M. Gietzmann & A. Ostaszewski, 1996. "Optimal Disbursement of a Sunk Resource and Decentralised Cost Allocation," Accounting and Business Research, Taylor & Francis Journals, vol. 27(1), pages 17-40.
    13. Prabhudev Konana & Alok Gupta & Andrew B. Whinston, 2000. "Integrating User Preferences and Real-Time Workload in Information Services," Information Systems Research, INFORMS, vol. 11(2), pages 177-196, June.
    14. Refael Hassin & Ran I. Snitkovsky, 2020. "Social and Monopoly Optimization in Observable Queues," Operations Research, INFORMS, vol. 68(4), pages 1178-1198, July.
    15. Canbolat, Pelin G., 2020. "Bounded rationality in clearing service systems," European Journal of Operational Research, Elsevier, vol. 282(2), pages 614-626.
    16. Refael Hassin, 2022. "Profit maximization and cost balancing in queueing systems," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 429-431, April.
    17. Fajardo, Val Andrei & Drekic, Steve, 2015. "Controlling the workload of M/G/1 queues via the q-policy," European Journal of Operational Research, Elsevier, vol. 243(2), pages 607-617.
    18. Tesnim Naceur & Yezekael Hayel, 2020. "Deterministic state-based information disclosure policies and social welfare maximization in strategic queueing systems," Queueing Systems: Theory and Applications, Springer, vol. 96(3), pages 303-328, December.
    19. Zhongbin Wang & Luyi Yang & Shiliang Cui & Jinting Wang, 2021. "In-queue priority purchase: a dynamic game approach," Queueing Systems: Theory and Applications, Springer, vol. 97(3), pages 343-381, April.
    20. Philipp Afèche & Haim Mendelson, 2004. "Pricing and Priority Auctions in Queueing Systems with a Generalized Delay Cost Structure," Management Science, INFORMS, vol. 50(7), pages 869-882, July.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:81:y:1995:i:2:p:324-335. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.