dc.creatorBonomo, Flavia
dc.creatorCatalán, Jaime
dc.creatorDuran, Ricardo Guillermo
dc.creatorEpstein, Rafael
dc.creatorGuajardo, Mario
dc.creatorJawtuschenko, Alexis Boris
dc.creatorMarenco, Javier Leonardo
dc.date.accessioned2018-08-15T11:19:10Z
dc.date.available2018-08-15T11:19:10Z
dc.date.created2018-08-15T11:19:10Z
dc.date.issued2017-11
dc.identifierBonomo, Flavia; Catalán, Jaime; Duran, Ricardo Guillermo; Epstein, Rafael; Guajardo, Mario; et al.; An Asymmetric Multi-Item Auction with Quantity Discounts Applied to Internet Service Procurement in Buenos Aires Public Schools; Springer; Annals Of Operations Research; 258; 11-2017; 569-585
dc.identifier0254-5330
dc.identifierhttp://hdl.handle.net/11336/55579
dc.identifierCONICET Digital
dc.identifierCONICET
dc.description.abstractThis article studies a multi-item auction characterized by asymmetricbidders and quantity discounts. We report a practical application of thistype of auction in the procurement of Internet services to the 709 publicschools of Buenos Aires. The asymmetry in this application is due to firms?existing technology infrastructures, which affect their ability to providethe service in certain areas of the city. A single round first-price sealed-bidauction, it required each participating firm to bid a supply curve specifyinga price on predetermined graduated quantity intervals and to identify theindividual schools it would supply. The maximal intersections of the setsof schools each participant has bid on define regions we call competitionunits. A single unit price must be quoted for all schools supplied withinthe same quantity interval, so that firms cannot bid a high price wherecompetition is weak and a lower one where it is strong. Quantity discountsare allowed so that the bids can reflect returns-to-scale of the suppliers andthe auctioneer may benefit of awarding bundles of units instead of separateunits. The winner determination problem in this auction poses a challengeto the auctioneer. We present an exponential formulation and a polynomialformulation for this problem, both based on integer linear programming.The polynomial formulation proves to find the optimal set of bids in amatter of seconds. Results of the real-world implementation are reported.
dc.languageeng
dc.publisherSpringer
dc.relationinfo:eu-repo/semantics/altIdentifier/url/https://link.springer.com/article/10.1007%2Fs10479-016-2164-x
dc.relationinfo:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/ 10.1007/s10479-016-2164-x
dc.rightshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.rightsinfo:eu-repo/semantics/restrictedAccess
dc.subjectMulti-Item Auction
dc.subjectQuantity Discounts
dc.subjectAsymmetric Bidders
dc.subjectInteger Linear Programming
dc.titleAn Asymmetric Multi-Item Auction with Quantity Discounts Applied to Internet Service Procurement in Buenos Aires Public Schools
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:ar-repo/semantics/artículo
dc.typeinfo:eu-repo/semantics/publishedVersion


Este ítem pertenece a la siguiente institución