TOP

, Volume 16, Issue 2, pp 319–344

A new pricing scheme based on DEA for iterative multi-unit combinatorial auctions

  • Juan Aparicio
  • Mercedes Landete
  • Juan Francisco Monge
  • Inmaculada Sirvent
Original Paper

DOI: 10.1007/s11750-008-0053-4

Cite this article as:
Aparicio, J., Landete, M., Monge, J.F. et al. TOP (2008) 16: 319. doi:10.1007/s11750-008-0053-4

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.

Keywords

DEA efficiency Winner-determination algorithm Auction design Combinatorial auction Iterative multi-unit auction 

Mathematics Subject Classification (2000)

90-02 90C10 90B50 

Copyright information

© Sociedad de Estadística e Investigación Operativa 2008

Authors and Affiliations

  • Juan Aparicio
    • 1
  • Mercedes Landete
    • 1
  • Juan Francisco Monge
    • 1
  • Inmaculada Sirvent
    • 1
  1. 1.Centro de Investigación OperativaUniversidad Miguel Hernández de ElcheElcheSpain

Personalised recommendations