IDEAS home Printed from https://ideas.repec.org/p/iim/iimawp/14554.html
   My bibliography  Save this paper

Optimization of Customized Pricing with Multiple Overlapping Competing Bids

Author

Listed:
  • Dutta, Goutam
  • Natesan, Sumeetha R.

Abstract

In this paper, we consider the case of project procurement where there is a single buyer and multiple sellers who are bidding. We consider one seller having one or more competitors. We formulate the pricing problem from the point of view of one seller having one or multiple competitors (say n). We also assume that based on past experience, we have some idea about the distribution of bid prices of the competitors. We consider uniform distribution to describe the bid price of the competitors. The prices of the competitors are pairwise mutually independent and the price range are either identical or different and overlapping. We consider maximizing the expected contribution. Assuming the contribution as a linear function of price we compute the conditions for maximization of the expected contribution to profit in case of n bidders. Further, we also compare the optimization results with simulation results.

Suggested Citation

  • Dutta, Goutam & Natesan, Sumeetha R., 2016. "Optimization of Customized Pricing with Multiple Overlapping Competing Bids," IIMA Working Papers WP2016-11-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
    • Handle: RePEc:iim:iimawp:14554
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    References listed on IDEAS

    as
    1. Robert M. Stark & Michael H. Rothkopf, 1979. "Competitive Bidding: A Comprehensive Bibliography," Operations Research, INFORMS, vol. 27(2), pages 364-390, April.
    2. Michael H. Rothkopf, 1980. "Equilibrium Linear Bidding Strategies," Operations Research, INFORMS, vol. 28(3-part-i), pages 576-583, June.
    3. Michael H. Rothkopf & Ronald M. Harstad, 1994. "Modeling Competitive Bidding: A Critical Essay," Management Science, INFORMS, vol. 40(3), pages 364-384, March.
    4. Martin Skitmore, 2004. "Predicting the probability of winning sealed bid auctions: the effects of outliers on bidding models," Construction Management and Economics, Taylor & Francis Journals, vol. 22(1), pages 101-109.
    5. M Skitmore, 2002. "Predicting the probability of winning sealed bid auctions: a comparison of models," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(1), pages 47-56, January.
    6. Milgrom, Paul R, 1981. "Rational Expectations, Information Acquisition, and Competitive Bidding," Econometrica, Econometric Society, vol. 49(4), pages 921-943, June.
    7. Milgrom, Paul R, 1979. "A Convergence Theorem for Competitive Bidding with Differential Information," Econometrica, Econometric Society, vol. 47(3), pages 679-688, May.
    8. Michael H. Rothkopf, 1969. "A Model of Rational Competitive Bidding," Management Science, INFORMS, vol. 15(7), pages 362-373, March.
    9. Dixie, JM, 1974. "Competitive bidding -- The probability of winning," Omega, Elsevier, vol. 2(3), pages 415-419, 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. Milgrom, Paul R & Weber, Robert J, 1982. "A Theory of Auctions and Competitive Bidding," Econometrica, Econometric Society, vol. 50(5), pages 1089-1122, September.
    2. Ronald M. Harstad & Aleksandar Saša Pekeč, 2008. "Relevance to Practice and Auction Theory: A Memorial Essay for Michael Rothkopf," Interfaces, INFORMS, vol. 38(5), pages 367-380, October.
    3. Laffont, Jean-Jacques, 1997. "Game theory and empirical economics: The case of auction data 1," European Economic Review, Elsevier, vol. 41(1), pages 1-35, January.
    4. Szentes, Balazs, 2005. "Equilibrium transformations and the Revenue Equivalence Theorem," Journal of Economic Theory, Elsevier, vol. 120(2), pages 175-205, February.
    5. Committee, Nobel Prize, 2020. "Improvements to auction theory and inventions of new auction formats," Nobel Prize in Economics documents 2020-2, Nobel Prize Committee.
    6. Aleksandar Saša Pekev{c} & Ilia Tsetlin, 2008. "Revenue Ranking of Discriminatory and Uniform Auctions with an Unknown Number of Bidders," Management Science, INFORMS, vol. 54(9), pages 1610-1623, September.
    7. Jean-Jacques Laffont, 1998. "Théorie des jeux et économie empirique : le cas des données issues d'enchères," Économie et Prévision, Programme National Persée, vol. 132(1), pages 121-137.
    8. Ronald M. Harstad, 2007. "Does a Seller Really Want Another Bidder?," Working Papers 0711, Department of Economics, University of Missouri.
    9. Swider, Derk J. & Weber, Christoph, 2007. "Bidding under price uncertainty in multi-unit pay-as-bid procurement auctions for power systems reserve," European Journal of Operational Research, Elsevier, vol. 181(3), pages 1297-1308, September.
    10. Rachel R. Chen & Robin O. Roundy & Rachel Q. Zhang & Ganesh Janakiraman, 2005. "Efficient Auction Mechanisms for Supply Chain Procurement," Management Science, INFORMS, vol. 51(3), pages 467-482, March.
    11. Cramton, Peter C, 1995. "Money Out of Thin Air: The Nationwide Narrowband PCS Auction," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 4(2), pages 267-343, Summer.
    12. Ceesay, Muhammed, 2023. "Secret vs Public Rings in Common Value Auctions," EconStor Preprints 279484, ZBW - Leibniz Information Centre for Economics.
    13. Han Hong & Harry J. Paarsch & Pai Xu, 2013. "On the asymptotic distribution of the transaction price in a clock model of a multi-unit, oral, ascending-price auction within the common-value paradigm," RAND Journal of Economics, RAND Corporation, vol. 44(4), pages 664-685, December.
    14. Neeman, Zvika & Orosel, Gerhard O., 1999. "Herding and the Winner's Curse in Markets with Sequential Bids," Journal of Economic Theory, Elsevier, vol. 85(1), pages 91-121, March.
    15. Elias Albagli & Christian Hellwig & Aleh Tsyvinski, 2024. "Information Aggregation with Asymmetric Asset Payoffs," Journal of Finance, American Finance Association, vol. 79(4), pages 2715-2758, August.
    16. Martinelli, Cesar, 2002. "Convergence Results for Unanimous Voting," Journal of Economic Theory, Elsevier, vol. 105(2), pages 278-297, August.
    17. Tunca, Tunay I., 2008. "Information precision and asymptotic efficiency of industrial markets," Journal of Mathematical Economics, Elsevier, vol. 44(9-10), pages 964-996, September.
    18. Hernando-Veciana, Ángel & Tröge, Michael, 2011. "The insider's curse," Games and Economic Behavior, Elsevier, vol. 71(2), pages 339-350, March.
    19. Peter Cramton & Yoav Shoham & Richard Steinberg, 2007. "An Overview of Combinatorial Auctions," Papers of Peter Cramton 07oca, University of Maryland, Department of Economics - Peter Cramton, revised 2007.
    20. Michael H. Rothkopf & Sunju Park, 2001. "An Elementary Introduction to Auctions," Interfaces, INFORMS, vol. 31(6), pages 83-97, December.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:iim:iimawp:14554. 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: the person in charge (email available below). General contact details of provider: https://edirc.repec.org/data/eciimin.html .

    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.