An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools
DOI10.1007/S10479-016-2164-XzbMATH Open1377.91103OpenAlexW2297586799MaRDI QIDQ1686513FDOQ1686513
Authors: Jaime Catalán, Guillermo Durán, Mario Guajardo, Javier Marenco, Flavia Bonomo, Rafael Epstein, Alexis B. Jawtuschenko 
Publication date: 15 December 2017
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-016-2164-x
Recommendations
- Optimal auctions for multi-unit procurement with volume discount bids
- Vickrey-Dutch procurement auction for multiple items
- Branch on Price: A Fast Winner Determination Algorithm for Discount Auctions
- Branch-and-cut algorithms for winner determination in discount auctions
- Optimal multi-unit combinatorial auctions
Linear programming (90C05) Auctions, bargaining, bidding and selling, and other market models (91B26) Integer programming (90C10)
Cites Work
- Least squares quantization in PCM
- Efficiency of a Good But Not Linear Set Union Algorithm
- A branch-and-cut algorithm for graph coloring
- Asymmetric Auctions
- Semiparametric estimation in models of first-price, sealed-bid auctions with affiliation
- Combinatorial auctions. Foreword by Vernon L. Smith.
- Strategic bidding in continuous electricity auctions: An application to the Spanish electricity market
- Title not available (Why is that?)
- Symmetry in integer linear programming
- Solving multiple scenarios in a combinatorial auction
- Combinatorial auctions
- Efficiency and synergy in a multi-unit auction with and without package bidding: An experimental study
- Trivial integer programs unsolvable by branch-and-bound
- Set Merging Algorithms
- Multiattribute electronic procurement using goal programming
- Title not available (Why is that?)
Cited In (5)
- On disclosure of participation in innovation contests: a dominance result
- A combinatorial auction improves school meals in Chile: a case of OR in developing countries
- Two-stage stochastic nonlinear winner determination for logistics service procurement auctions under quantity discounts
- Branch-and-cut algorithms for winner determination in discount auctions
- Branch on Price: A Fast Winner Determination Algorithm for Discount Auctions
This page was built for publication: An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1686513)
