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

Bayesian optimal knapsack procurement

Author

Listed:
  • Ensthaler, Ludwig
  • Giebe, Thomas

Abstract

A budget-constrained buyer wants to purchase items from a shortlisted set. Items are differentiated by observable quality and sellers have private reserve prices for their items. The buyer’s problem is to select a subset of maximal quality. Money does not enter the buyer’s objective function, but only his constraints. Sellers quote prices strategically, inducing a knapsack game. We report the Bayesian optimal mechanism for the buyer’s problem. We find that simultaneous take-it-or-leave-it offers are interim optimal.

Suggested Citation

  • Ensthaler, Ludwig & Giebe, Thomas, 2014. "Bayesian optimal knapsack procurement," European Journal of Operational Research, Elsevier, vol. 234(3), pages 774-779.
    • Handle: RePEc:eee:ejores:v:234:y:2014:i:3:p:774-779
    DOI: 10.1016/j.ejor.2013.09.031
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221713007868
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2013.09.031?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. 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.
    2. Baron, David P & Myerson, Roger B, 1982. "Regulating a Monopolist with Unknown Costs," Econometrica, Econometric Society, vol. 50(4), pages 911-930, July.
    3. Tilman Börgers & Peter Norman, 2009. "A note on budget balance under interim participation constraints: the case of independent types," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 39(3), pages 477-489, June.
    4. Oliveira, Fernando S. & Ruiz, Carlos & Conejo, Antonio J., 2013. "Contract design and supply chain coordination in the electricity industry," European Journal of Operational Research, Elsevier, vol. 227(3), pages 527-537.
    5. Dasu, Sriram & Tong, Chunyang, 2010. "Dynamic pricing when consumers are strategic: Analysis of posted and contingent pricing schemes," European Journal of Operational Research, Elsevier, vol. 204(3), pages 662-671, August.
    6. Hamid Nazerzadeh & Amin Saberi & Rakesh Vohra, 2013. "Dynamic Pay-Per-Action Mechanisms and Applications to Online Advertising," Operations Research, INFORMS, vol. 61(1), pages 98-111, February.
    7. Fandel, G. & Trockel, J., 2013. "Avoiding non-optimal management decisions by applying a three-person inspection game," European Journal of Operational Research, Elsevier, vol. 226(1), pages 85-93.
    8. Giebe, Thomas & Grebe, Tim & Wolfstetter, Elmar, 2006. "How to allocate R&D (and other) subsidies: An experimentally tested policy recommendation," Research Policy, Elsevier, vol. 35(9), pages 1261-1272, November.
    9. Martin Shubik, 2002. "Game Theory and Operations Research: Some Musings 50 Years Later," Operations Research, INFORMS, vol. 50(1), pages 192-196, February.
    10. Jérémie Gallien, 2006. "Dynamic Mechanism Design for Online Commerce," Operations Research, INFORMS, vol. 54(2), pages 291-310, April.
    11. , & , & ,, 2011. "Revenue maximization in the dynamic knapsack problem," Theoretical Economics, Econometric Society, vol. 6(2), May.
    12. Ensthaler, Ludwig & Giebe, Thomas, 2014. "A dynamic auction for multi-object procurement under a hard budget constraint," Research Policy, Elsevier, vol. 43(1), pages 179-189.
    13. Shahar Dobzinski & Noam Nisan & Michael Schapira, 2010. "Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders," Mathematics of Operations Research, INFORMS, vol. 35(1), pages 1-13, February.
    14. Itai Ashlagi & Dov Monderer & Moshe Tennenholtz, 2011. "Simultaneous Ad Auctions," Mathematics of Operations Research, INFORMS, vol. 36(1), pages 1-13, February.
    15. Avenhaus, Rudolf & Krieger, Thomas, 2013. "Distributing inspections in space and time – Proposed solution of a difficult problem," European Journal of Operational Research, Elsevier, vol. 231(3), pages 712-719.
    16. Muratore, Gabriella, 2011. "Incentive based energy market design," European Journal of Operational Research, Elsevier, vol. 213(2), pages 422-429, September.
    17. Knight, Vincent A. & Harper, Paul R., 2013. "Selfish routing in public services," European Journal of Operational Research, Elsevier, vol. 230(1), pages 122-132.
    18. Pengfei Guo & Refael Hassin, 2011. "Strategic Behavior and Social Optimization in Markovian Vacation Queues," Operations Research, INFORMS, vol. 59(4), pages 986-997, August.
    19. Itai Ashlagi & Shahar Dobzinski & Ron Lavi, 2012. "Optimal Lower Bounds for Anonymous Scheduling Mechanisms," Mathematics of Operations Research, INFORMS, vol. 37(2), pages 244-258, May.
    20. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    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. Jarman, Felix & Meisner, Vincent, 2017. "Ex-post optimal knapsack procurement," Journal of Economic Theory, Elsevier, vol. 171(C), pages 35-63.
    2. Pferschy, Ulrich & Nicosia, Gaia & Pacifici, Andrea & Schauer, Joachim, 2021. "On the Stackelberg knapsack game," European Journal of Operational Research, Elsevier, vol. 291(1), pages 18-31.
    3. Fernández, Arturo J., 2015. "Optimum attributes component test plans for k-out-of-n:F Weibull systems using prior information," European Journal of Operational Research, Elsevier, vol. 240(3), pages 688-696.

    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. Jarman, Felix & Meisner, Vincent, 2017. "Ex-post optimal knapsack procurement," Journal of Economic Theory, Elsevier, vol. 171(C), pages 35-63.
    2. Mallesh M. Pai & Rakesh Vohra, 2013. "Optimal Dynamic Auctions and Simple Index Rules," Mathematics of Operations Research, INFORMS, vol. 38(4), pages 682-697, November.
    3. Sham M. Kakade & Ilan Lobel & Hamid Nazerzadeh, 2013. "Optimal Dynamic Mechanism Design and the Virtual-Pivot Mechanism," Operations Research, INFORMS, vol. 61(4), pages 837-854, August.
    4. Gershkov, Alex & Moldovanu, Benny, 2012. "Dynamic allocation and pricing: A mechanism design approach," International Journal of Industrial Organization, Elsevier, vol. 30(3), pages 283-286.
    5. Santiago R. Balseiro & Omar Besbes & Gabriel Y. Weintraub, 2019. "Dynamic Mechanism Design with Budget-Constrained Buyers Under Limited Commitment," Operations Research, INFORMS, vol. 67(3), pages 711-730, May.
    6. Tao Zhang & Quanyan Zhu, 2019. "On Incentive Compatibility in Dynamic Mechanism Design With Exit Option in a Markovian Environment," Papers 1909.13720, arXiv.org, revised May 2021.
    7. Tao Zhang & Quanyan Zhu, 2022. "On Incentive Compatibility in Dynamic Mechanism Design With Exit Option in a Markovian Environment," Dynamic Games and Applications, Springer, vol. 12(2), pages 701-745, June.
    8. Hanming Fang & Peter Norman, 2014. "Toward an efficiency rationale for the public provision of private goods," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 56(2), pages 375-408, June.
    9. Ying-Ju Chen, 2017. "Optimal Dynamic Auctions for Display Advertising," Operations Research, INFORMS, vol. 65(4), pages 897-913, August.
    10. Yiwei Chen & Nikolaos Trichakis, 2021. "Technical Note—On Revenue Management with Strategic Customers Choosing When and What to Buy," Operations Research, INFORMS, vol. 69(1), pages 175-187, January.
    11. Arve, Malin, 2014. "Procurement and predation: Dynamic sourcing from financially constrained suppliers," Journal of Public Economics, Elsevier, vol. 120(C), pages 157-168.
    12. Mierendorff, Konrad, 2016. "Optimal dynamic mechanism design with deadlines," Journal of Economic Theory, Elsevier, vol. 161(C), pages 190-222.
    13. Baliga Sandeep & Vohra Rakesh, 2003. "Market Research and Market Design," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 3(1), pages 1-27, August.
    14. Hanming Fang & Peter Norman, 2010. "Optimal Provision of Multiple Excludable Public Goods," American Economic Journal: Microeconomics, American Economic Association, vol. 2(4), pages 1-37, November.
    15. Yash Kanoria & Hamid Nazerzadeh, 2020. "Dynamic Reserve Prices for Repeated Auctions: Learning from Bids," Papers 2002.07331, arXiv.org.
    16. Gérard Mondello, 2012. "Strict Liability, Capped Strict Liability, and Care Effort under Asymmetric Information," Journal of Institutional and Theoretical Economics (JITE), Mohr Siebeck, Tübingen, vol. 168(2), pages 232-251, June.
    17. Pavlov Gregory, 2011. "Optimal Mechanism for Selling Two Goods," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 11(1), pages 1-35, February.
    18. Szalay, Dezsö, 2009. "Contracts with endogenous information," Games and Economic Behavior, Elsevier, vol. 65(2), pages 586-625, March.
    19. Rosar, Frank, 2017. "Strategic outsourcing and optimal procurement," International Journal of Industrial Organization, Elsevier, vol. 50(C), pages 91-130.
    20. Li, Yunan, 2019. "Efficient mechanisms with information acquisition," Journal of Economic Theory, Elsevier, vol. 182(C), pages 279-328.

    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:234:y:2014:i:3:p:774-779. 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.