Exact methods for combinatorial auctions

被引：0
作者：
Dries Goossens
机构：
[1] Katholieke Universiteit Leuven,Research center for Operations Research and Business Statistics
来源：
4OR | 2007年 / 5卷
关键词：
Combinatorial auction; Winner determination problem; Exact method; Complexity; 90C27; 91B26;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
This is a summary of the author’s PhD thesis supervised by Frits Spieksma and defended on 20 December 2006 at the Katholieke Universiteit Leuven. The thesis is written in English and is available from the author’s website (http://www.econ.kuleuven.be/dries.goossens/public). This work deals with combinatorial auctions, i.e., auctions where bidders can bid on sets of items. We study two special cases, namely the total quantity discount auction and the matrix bid auction.
引用
收藏
页码：335 / 338
页数：3
相关论文
共 7 条
  • [1] Goossens D(2007)Exact algorithms for procurement problems under a total quantity discount structure Eur J Oper Res 178 603-626
  • [2] Maas AJT(2002)Algorithm for optimal winner determination in combinatorial auctions Artif Intell 135 1-54
  • [3] Spieksma FCR(2001)Optimization in electronic markets: examples in combinatorial auctions Netnomics 3 23-33
  • [4] van de Klundert JJ(undefined)undefined undefined undefined undefined-undefined
  • [5] Sandholm T(undefined)undefined undefined undefined undefined-undefined
  • [6] Van Hoesel S(undefined)undefined undefined undefined undefined-undefined
  • [7] Müller R(undefined)undefined undefined undefined undefined-undefined
1