IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v32y2002i6p1-14.html
   My bibliography  Save this article

A Combinational Auction Improves School Meals in Chile

Author

Listed:
  • Rafael Epstein

    (Department of Industrial Engineering, University of Chile, República 701, Santiago, Chile)

  • Lysette Henríquez

    (United Nations Development Programme (UNDP), Presidente Masaryk 29 Piso 8, CP11570, Mexico DF, Mexico)

  • Jaime Catalán

    (Department of Industrial Engineering, University of Chile, República 701, Santiago, Chile)

  • Gabriel Y. Weintraub

    (Department of Industrial Engineering, University of Chile, República 701, Santiago, Chile)

  • Cristián Martínez

    (Supervision Department, JUNAEB, Chile, Antonio Varas 153, Providencia, Santiago, Chile)

Abstract

Chileȧs school system is using mathematical modeling to assign catering contracts in a singleround sealed-bid combinational auction. The Chilean state spends around US$180 million a year to feed 1,300,000 students from low income families, making this one of the largest state auctions. To improve the quality of the assignment in the auction process, we constructed an integer linear programming model to decide contract awards optimally among different concession holders. The model completely changed the nature of the process in three crucial aspects. First, it gave transparency and objectivity to the complete process, generating competition among firms. Second, it allowed the companies to build flexible territorial bids to include their scale economies, leading to efficient resource allocation. Finally, the model indeed found an optimal solution, which is not easy because the assignment problem was NP-complete with more than 10,000 binary variables. This new methodology improved the price-quality ratio of the meals with yearly savings of around US$40 million—equivalent to the cost of feeding 300,000 children during one year.

Suggested Citation

  • Rafael Epstein & Lysette Henríquez & Jaime Catalán & Gabriel Y. Weintraub & Cristián Martínez, 2002. "A Combinational Auction Improves School Meals in Chile," Interfaces, INFORMS, vol. 32(6), pages 1-14, December.
  • Handle: RePEc:inm:orinte:v:32:y:2002:i:6:p:1-14
    DOI: 10.1287/inte.32.6.1.6476
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.32.6.1.6476
    Download Restriction: no

    File URL: https://libkey.io/10.1287/inte.32.6.1.6476?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
    ---><---

    References listed on IDEAS

    as
    1. Paul Klemperer, 1999. "Auction Theory: A Guide to the Literature," Journal of Economic Surveys, Wiley Blackwell, vol. 13(3), pages 227-286, July.
    2. Frank Kelly & Richard Steinberg, 2000. "A Combinatorial Auction with Multiple Winners for Universal Service," Management Science, INFORMS, vol. 46(4), pages 586-596, April.
    3. Harlan Crowder & Ellis L. Johnson & Manfred Padberg, 1983. "Solving Large-Scale Zero-One Linear Programming Problems," Operations Research, INFORMS, vol. 31(5), pages 803-834, October.
    4. A. Balakrishnan & T. L. Magnanti & R. T. Wong, 1989. "A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design," Operations Research, INFORMS, vol. 37(5), pages 716-740, October.
    5. Michael H. Rothkopf & Aleksandar Pekev{c} & Ronald M. Harstad, 1998. "Computationally Manageable Combinational Auctions," Management Science, INFORMS, vol. 44(8), pages 1131-1147, August.
    6. Klemperer, Paul, 1999. " Auction Theory: A Guide to the Literature," Journal of Economic Surveys, Wiley Blackwell, vol. 13(3), pages 227-86, July.
    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. F. Bonomo & J. Catalán & G. Durán & R. Epstein & M. Guajardo & A. Jawtuschenko & J. Marenco, 2017. "An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools," Annals of Operations Research, Springer, vol. 258(2), pages 569-585, November.
    2. Kazumori, Eiichiro & Belch, Yaakov, 2019. "t-Tree: The Tokyo toolbox for large-scale combinatorial auction experiments," Journal of Behavioral and Experimental Finance, Elsevier, vol. 24(C).
    3. Dries R. Goossens & Rudolf Müller & Frits C. R. Spieksma, 2010. "Algorithms for Recognizing Economic Properties in Matrix Bid Combinatorial Auctions," INFORMS Journal on Computing, INFORMS, vol. 22(3), pages 339-352, August.
    4. Gediminas Adomavicius & Shawn P. Curley & Alok Gupta & Pallab Sanyal, 2012. "Effect of Information Feedback on Bidder Behavior in Continuous Combinatorial Auctions," Management Science, INFORMS, vol. 58(4), pages 811-830, April.
    5. Dries R. Goossens & Sander Onderstal & Jan Pijnacker & Frits C. R. Spieksma, 2014. "Solids: A Combinatorial Auction for Real Estate," Interfaces, INFORMS, vol. 44(4), pages 351-363, August.
    6. Sang Won Kim & Marcelo Olivares & Gabriel Y. Weintraub, 2014. "Measuring the Performance of Large-Scale Combinatorial Auctions: A Structural Estimation Approach," Management Science, INFORMS, vol. 60(5), pages 1180-1201, May.
    7. Guillermo Durán & Rafael Epstein & Cristian Martinez & Gonzalo Andres Zamorano, 2011. "Quantitative Methods for a New Configuration of Territorial Units in a Chilean Government Agency Tender Process," Interfaces, INFORMS, vol. 41(3), pages 263-277, June.
    8. Ignacio Palacios-Huerta & David C. Parkes & Richard Steinberg, 2024. "Combinatorial Auctions in Practice," Journal of Economic Literature, American Economic Association, vol. 62(2), pages 517-553, June.
    9. 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.
    10. Chernomaz, Kirill & Levin, Dan, 2012. "Efficiency and synergy in a multi-unit auction with and without package bidding: An experimental study," Games and Economic Behavior, Elsevier, vol. 76(2), pages 611-635.
    11. Aleksandar Pekev{c} & Michael H. Rothkopf, 2003. "Combinatorial Auction Design," Management Science, INFORMS, vol. 49(11), pages 1485-1503, November.
    12. Biswal, Arun Kumar & Jenamani, Mamata & Kumar, Sri Krishna, 2018. "Warehouse efficiency improvement using RFID in a humanitarian supply chain: Implications for Indian food security system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 109(C), pages 205-224.
    13. 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.
    14. Guillermo Durán & Rodrigo Wolf-Yadlin, 2011. "A Mathematical Programming Approach to Applicant Selection for a Degree Program Based on Affirmative Action," Interfaces, INFORMS, vol. 41(3), pages 278-288, June.
    15. Md Hafizul Islam & Julie Simmons Ivy, 2022. "Modeling the role of efficiency for the equitable and effective distribution of donated food," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(2), pages 485-534, June.
    16. John Turner & Ben Peterson & Soo-Haeng Cho & Sunder Kekre & Alan Scheller-Wolf, 2012. "A Large US Retailer Selects Transportation Carriers Under Diesel Price Uncertainty," Interfaces, INFORMS, vol. 42(4), pages 365-379, August.
    17. Ott, Marion, 2019. "Simple Bayesian and Ex-Post Equilibria in Combinatorial Auctions," VfS Annual Conference 2019 (Leipzig): 30 Years after the Fall of the Berlin Wall - Democracy and Market Economy 203616, Verein für Socialpolitik / German Economic Association.
    18. Jawad Abrache & Teodor Crainic & Michel Gendreau & Monia Rekik, 2007. "Combinatorial auctions," Annals of Operations Research, Springer, vol. 153(1), pages 131-164, September.

    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. Pinar Keskinocak & Shidhar Tayur, 2001. "Quantitative Analysis for Internet-Enabled Supply Chains," Interfaces, INFORMS, vol. 31(2), pages 70-89, April.
    2. Jérémie Gallien & Lawrence M. Wein, 2005. "A Smart Market for Industrial Procurement with Capacity Constraints," Management Science, INFORMS, vol. 51(1), pages 76-91, January.
    3. 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.
    4. Jawad Abrache & Teodor Crainic & Michel Gendreau & Monia Rekik, 2007. "Combinatorial auctions," Annals of Operations Research, Springer, vol. 153(1), pages 131-164, September.
    5. Hur, Daesik & Mabert, Vincent A. & Hartley, Janet L., 2007. "Getting the most out of reverse e-auction investment," Omega, Elsevier, vol. 35(4), pages 403-416, August.
    6. Oktay Günlük & Lászlo Ladányi & Sven de Vries, 2005. "A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions," Management Science, INFORMS, vol. 51(3), pages 391-406, March.
    7. Yokoo, Makoto & Sakurai, Yuko & Matsubara, Shigeo, 2004. "The effect of false-name bids in combinatorial auctions: new fraud in internet auctions," Games and Economic Behavior, Elsevier, vol. 46(1), pages 174-188, January.
    8. Elmaghraby, Wedad J., 2005. "Multi-unit auctions with complementarities: Issues of efficiency in electricity auctions," European Journal of Operational Research, Elsevier, vol. 166(2), pages 430-448, October.
    9. 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.
    10. Michael H. Rothkopf & Sunju Park, 2001. "An Elementary Introduction to Auctions," Interfaces, INFORMS, vol. 31(6), pages 83-97, December.
    11. Dass, Mayukh & Reddy, Srinivas K. & Iacobucci, Dawn, 2014. "A Network Bidder Behavior Model in Online Auctions: A Case of Fine Art Auctions," Journal of Retailing, Elsevier, vol. 90(4), pages 445-462.
    12. 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.
    13. Grigoriev, A. & Hiller, B. & Marban, S. & Vredeveld, T. & van der Zwaan, G.R.J., 2010. "Dynamic pricing problems with elastic demand," Research Memorandum 053, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    14. Philippe Février & William Roos & Michael Visser, 2005. "The Buyer's Option in Multi‐Unit Ascending Auctions: The Case of Wine Auctions at Drouot," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 14(4), pages 813-847, December.
    15. Zhang, Ning, 2009. "Market performance and bidders' bidding behavior in the New York Transmission Congestion Contract market," Energy Economics, Elsevier, vol. 31(1), pages 61-68, January.
    16. Marco A. Haan & Linda A. Toolsema, 2011. "License Auctions When Winning Bids Are Financed Through Debt," Journal of Industrial Economics, Wiley Blackwell, vol. 59(2), pages 254-281, June.
    17. Kellermann, Konrad & Balmann, Alfons, 2006. "How Smart Should Farms Be Modeled? Behavioral Foundation of Bidding Strategies in Agent-Based Land Market Models," 2006 Annual Meeting, August 12-18, 2006, Queensland, Australia 25446, International Association of Agricultural Economists.
    18. Schamel, Guenter, 2006. "Auction Markets for Specialty Food Products with Geographical Indications," 2006 Annual Meeting, August 12-18, 2006, Queensland, Australia 25606, International Association of Agricultural Economists.
    19. Derek Clark & Christian Riis, 2008. "Rational benevolence in small committees," Public Choice, Springer, vol. 134(3), pages 139-146, March.
    20. Daniel Lacker & Kavita Ramanan, 2019. "Rare Nash Equilibria and the Price of Anarchy in Large Static Games," Mathematics of Operations Research, INFORMS, vol. 44(2), pages 400-422, May.

    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:inm:orinte:v:32:y:2002:i:6:p:1-14. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.