Abstract
Iterative Multi-unit Combinatorial Auctions are auctions in which: bidders can express bids in successive rounds until a stopping rule is held; there are multiple units of each item; and bids are bundles of items. Data Envelopment Analysis (DEA) is a nonparametric method for measuring the relative efficiency of a set of homogeneous units. In this work, we present an algorithm for solving an iterative multi-unit combinatorial auction in which the auctioneer computes at each round a linear anonymous price for each item by using a DEA model and pushes bidders to express bids according to them. A computational study is carried out in order to check the performance of the proposed design.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
