IDEAS home Printed from https://ideas.repec.org/a/eee/dyncon/v21y1997i4-5p697-722.html
   My bibliography  Save this article

A stochastic equilibrium model of internet pricing

Author

Listed:
  • Gupta, Alok
  • Stahl, Dale O.
  • Whinston, Andrew B.

Abstract

No abstract is available for this item.

Suggested Citation

  • Gupta, Alok & Stahl, Dale O. & Whinston, Andrew B., 1997. "A stochastic equilibrium model of internet pricing," Journal of Economic Dynamics and Control, Elsevier, vol. 21(4-5), pages 697-722, May.
    • Handle: RePEc:eee:dyncon:v:21:y:1997:i:4-5:p:697-722
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165-1889(96)00003-6
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to look for a different version below or

    for a different version of it.

    Other versions of this item:

    References listed on IDEAS

    as
    1. Stahl, Dale II, 1986. "Stochastic decentralization of competitive allocations," Economics Letters, Elsevier, vol. 22(2-3), pages 111-113.
    2. Naor, P, 1969. "The Regulation of Queue Size by Levying Tolls," Econometrica, Econometric Society, vol. 37(1), pages 15-24, January.
    3. Hau Leung Lee & Morris A. Cohen, 1985. "Multi-Agent Customer Allocation in a Stochastic Service System," Management Science, INFORMS, vol. 31(6), pages 752-763, June.
    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. Dale Stahl, "undated". "Pricing for Electronic Commerce," Computing in Economics and Finance 1996 _054, Society for Computational Economics.
    2. Nicos Savva & Tolga Tezcan & Özlem Yıldız, 2019. "Can Yardstick Competition Reduce Waiting Times?," Management Science, INFORMS, vol. 65(7), pages 3196-3215, July.
    3. Eitan Altman & Nahum Shimkin, 1998. "Individual Equilibrium and Learning in Processor Sharing Systems," Operations Research, INFORMS, vol. 46(6), pages 776-784, December.
    4. Grossman, Thomas A. & Brandeau, Margaret L., 2002. "Optimal pricing for service facilities with self-optimizing customers," European Journal of Operational Research, Elsevier, vol. 141(1), pages 39-57, August.
    5. L D Smith & D C Sweeney & J F Campbell, 2009. "Simulation of alternative approaches to relieving congestion at locks in a river transportion system," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(4), pages 519-533, April.
    6. Refael Hassin, 2022. "Profit maximization and cost balancing in queueing systems," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 429-431, April.
    7. Jalili Marand, Ata & Hoseinpour, Pooya, 2024. "A congested facility location problem with strategic customers," European Journal of Operational Research, Elsevier, vol. 318(2), pages 442-456.
    8. Kyle Y. Lin, 2003. "Decentralized admission control of a queueing system: A game‐theoretic model," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(7), pages 702-718, October.
    9. Kyle Y. Lin & Sheldon M. Ross, 2003. "Admission Control with Incomplete Information of a Queueing System," Operations Research, INFORMS, vol. 51(4), pages 645-654, August.
    10. 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.
    11. Thomas Kittsteiner & Benny Moldovanu, 2005. "Priority Auctions and Queue Disciplines That Depend on Processing Time," Management Science, INFORMS, vol. 51(2), pages 236-248, February.
    12. Parlakturk, Ali & Kumar, Sunil, 2004. "Self-Interested Routing in Queueing Networks," Research Papers 1782r, Stanford University, Graduate School of Business.
    13. Xiuli Chao & Liming Liu & Shaohui Zheng, 2003. "Resource Allocation in Multisite Service Systems with Intersite Customer Flows," Management Science, INFORMS, vol. 49(12), pages 1739-1752, December.
    14. Odysseas Kanavetas & Barış Balcıog̃lu, 2022. "The “Sensitive” Markovian queueing system and its application for a call center problem," Annals of Operations Research, Springer, vol. 317(2), pages 651-664, October.
    15. Legros, Benjamin & Fransoo, Jan C., 2023. "Admission and pricing optimization of on-street parking with delivery bays," Other publications TiSEM 6d41ee5c-27dc-4d34-aff1-4, Tilburg University, School of Economics and Management.
    16. Eliran Sherzer & Yoav Kerner, 2018. "Customers’ abandonment strategy in an M / G / 1 queue," Queueing Systems: Theory and Applications, Springer, vol. 90(1), pages 65-87, October.
    17. 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.
    18. Jalili Marand, Ata & Tang, Ou & Li, Hongyan, 2019. "Quandary of service logistics: Fast or reliable?," European Journal of Operational Research, Elsevier, vol. 275(3), pages 983-996.
    19. Laurens Debo & Uday Rajan & Senthil K. Veeraraghavan, 2020. "Signaling Quality via Long Lines and Uninformative Prices," Manufacturing & Service Operations Management, INFORMS, vol. 22(3), pages 513-527, May.
    20. Dimitrakopoulos, Y. & Burnetas, A.N., 2016. "Customer equilibrium and optimal strategies in an M/M/1 queue with dynamic service control," European Journal of Operational Research, Elsevier, vol. 252(2), pages 477-486.

    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:dyncon:v:21:y:1997:i:4-5:p:697-722. 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/jedc .

    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.