An overview of combinatorial auctions
An overview of combinatorial auctions
复制标题
组合拍卖概述
DOI：
--
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
R. Steinberg
中科院分区：
文献类型：
--
作者：
P. Cramton;Y. Shoham;R. Steinberg
拍卖是组合拍卖，即投标人可以对被称为“包”的项目组合而不是单个项目出价。计算机科学家对组合拍卖很感兴趣，因为他们关心投标语言的表达能力，以及潜在的组合问题的算法方面。组合问题引起了运筹学研究者的注意，特别是那些从事组合优化和数学规划的研究者，他们对将这些工具应用于拍卖的想法很感兴趣。当然，拍卖已经被经济学家广泛研究过了。因此，组合拍卖这一新兴领域处于计算机科学、运筹学和经济学的交叉点。在这篇文章中，我们提出了一个简单的介绍组合拍卖，根据我们的书，组合拍卖（麻省理工学院出版社，2006年），我们看组合拍卖从所有三个角度。
An auction is combinatorial when bidders can place bids on combinations of items, called “packages,” rather than just individual items. Computer scientists are interested in combinatorial auctions because they are concerned with the expressiveness of bidding languages, as well as the algorithmic aspects of the underlying combinatorial problem. The combinatorial problem has attracted attention from operations researchers, especially those working in combinatorial optimization and mathematical programming, who are fascinated by the idea of applying these tools to auctions. Auctions have been studied extensively by economists, of course. Thus, the newly emerging field of combinatorial auctions lies at the intersection of computer science, operations research, and economics. In this article, we present a brief introduction to combinatorial auctions, based on our book, Combinatorial Auctions (MIT Press, 2006), in which we look at combinatorial auctions from all three perspectives.