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

Pricing in multiple-item procurement auctions with a common to all items fixed cost

Author

Listed:
  • Lorentziadis, Panos L.

Abstract

In a sealed bid multiple-item procurement auction, bidders may incur a fixed cost, which is common to all items. The paper develops pricing methods which ensure that a preset percentage profit level is always realized and the fixed cost is completely recovered, even if the eventual order is for some of the items at reduced quantities. One approach sets constraints and determines acceptable orders. Another alternative is to provide appropriate discounts. Finally, a third method considers fixed prices and imposes constraints that address the exposure problem of recovering the fixed cost. These methods may also be used for pricing combinatorial auctions.

Suggested Citation

  • Lorentziadis, Panos L., 2008. "Pricing in multiple-item procurement auctions with a common to all items fixed cost," European Journal of Operational Research, Elsevier, vol. 190(3), pages 790-797, November.
    • Handle: RePEc:eee:ejores:v:190:y:2008:i:3:p:790-797
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(07)00636-4
    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. Aleksandar Pekev{c} & Michael H. Rothkopf, 2003. "Combinatorial Auction Design," Management Science, INFORMS, vol. 49(11), pages 1485-1503, November.
    2. Xia, Mu & Koehler, Gary J. & Whinston, Andrew B., 2004. "Pricing combinatorial auctions," European Journal of Operational Research, Elsevier, vol. 154(1), pages 251-270, April.
    3. Susan I. Cohen & Martin Loeb, 1990. "Implicit Cost Allocation and Bidding for Contracts," Management Science, INFORMS, vol. 36(9), pages 1133-1138, September.
    4. James J. Anton & Dennis A. Yao, 1989. "Split Awards, Procurement, and Innovation," RAND Journal of Economics, The RAND Corporation, vol. 20(4), pages 538-552, Winter.
    5. Sven de Vries & Rakesh V. Vohra, 2003. "Combinatorial Auctions: A Survey," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 284-309, August.
    6. Milgrom, Paul R & Weber, Robert J, 1982. "A Theory of Auctions and Competitive Bidding," Econometrica, Econometric Society, vol. 50(5), pages 1089-1122, September.
    7. Michael H. Rothkopf & Ronald M. Harstad, 1994. "Modeling Competitive Bidding: A Critical Essay," Management Science, INFORMS, vol. 40(3), pages 364-384, March.
    8. Lawrence Friedman, 1956. "A Competitive-Bidding Strategy," Operations Research, INFORMS, vol. 4(1), pages 104-112, February.
    9. Michael H. Rothkopf & Sunju Park, 2001. "An Elementary Introduction to Auctions," Interfaces, INFORMS, vol. 31(6), pages 83-97, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Lorentziadis, Panos L., 2016. "Optimal bidding in auctions from a game theory perspective," European Journal of Operational Research, Elsevier, vol. 248(2), pages 347-371.
    2. Kokott, Gian-Marco & Bichler, Martin & Paulsen, Per, 2019. "The beauty of Dutch: Ex-post split-award auctions in procurement markets with diseconomies of scale," European Journal of Operational Research, Elsevier, vol. 278(1), pages 202-210.

    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. 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.
    2. Jawad Abrache & Teodor Crainic & Michel Gendreau & Monia Rekik, 2007. "Combinatorial auctions," Annals of Operations Research, Springer, vol. 153(1), pages 131-164, September.
    3. Lorentziadis, Panos L., 2016. "Optimal bidding in auctions from a game theory perspective," European Journal of Operational Research, Elsevier, vol. 248(2), pages 347-371.
    4. Pickl, Matthias & Wirl, Franz, 2011. "Auction design for gas pipeline transportation capacity--The case of Nabucco and its open season," Energy Policy, Elsevier, vol. 39(4), pages 2143-2151, April.
    5. 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.
    6. Drexl, Andreas & Jørnsten, Kurt & Knof, Diether, 2007. "Column aggregation-based pricing combinatorial auctions," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 624, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    7. Michael H. Rothkopf & Sunju Park, 2001. "An Elementary Introduction to Auctions," Interfaces, INFORMS, vol. 31(6), pages 83-97, December.
    8. Griffin, Robert, 2013. "Auction designs for allocating wind energy leases on the U.S. outer continentalshelf," Energy Policy, Elsevier, vol. 56(C), pages 603-611.
    9. Leon Yang Chu, 2009. "Truthful Bundle/Multiunit Double Auctions," Management Science, INFORMS, vol. 55(7), pages 1184-1198, July.
    10. Edieal J. Pinker & Abraham Seidmann & Yaniv Vakrat, 2003. "Managing Online Auctions: Current Business and Research Issues," Management Science, INFORMS, vol. 49(11), pages 1457-1484, November.
    11. O'Shaughnessy, Eric, 2019. "Non-monotonic effects of market concentration on prices for residential solar photovoltaics in the United States," Energy Economics, Elsevier, vol. 78(C), pages 182-191.
    12. Lorentziadis, Panos L., 2012. "Optimal bidding in auctions of mixed populations of bidders," European Journal of Operational Research, Elsevier, vol. 217(3), pages 653-663.
    13. Schellhorn, Henry, 2009. "A double-sided multiunit combinatorial auction for substitutes: Theory and algorithms," European Journal of Operational Research, Elsevier, vol. 197(2), pages 799-808, September.
    14. G. Anandalingam & Robert W. Day & S. Raghavan, 2005. "The Landscape of Electronic Market Design," Management Science, INFORMS, vol. 51(3), pages 316-327, March.
    15. Avenali, Alessandro, 2009. "Exploring the VCG mechanism in combinatorial auctions: The threshold revenue and the threshold-price rule," European Journal of Operational Research, Elsevier, vol. 199(1), pages 262-275, November.
    16. Muñoz, Juan Carlos & Molina, Diego, 2009. "A multi-unit tender award process: The case of Transantiago," European Journal of Operational Research, Elsevier, vol. 197(1), pages 307-311, August.
    17. Meeus, Leonardo & Verhaegen, Karolien & Belmans, Ronnie, 2009. "Block order restrictions in combinatorial electric energy auctions," European Journal of Operational Research, Elsevier, vol. 196(3), pages 1202-1206, August.
    18. Henry Schellhorn, 2004. "A Double-Sided Multiunit Combinatorial Auction for Substitutes: Theory and Algorithms," FAME Research Paper Series rp123, International Center for Financial Asset Management and Engineering.
    19. Michael H. Rothkopf, 2007. "Decision Analysis: The Right Tool for Auctions," Decision Analysis, INFORMS, vol. 4(3), pages 167-172, September.
    20. Thomas D. Jeitschko, 1998. "Learning in Sequential Auctions," Southern Economic Journal, John Wiley & Sons, vol. 65(1), pages 98-112, 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:190:y:2008:i:3:p:790-797. 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.