Algorithm for optimal winner determination in combinatorial auctions
Reads0
Chats0
TLDR
The algorithm allows combinatorial auctions to scale up to significantly larger numbers of items and bids than prior approaches to optimal winner determination by capitalizing on the fact that the space of bids is sparsely populated in practice.About:
This article is published in Artificial Intelligence.The article was published on 2002-02-01 and is currently open access. It has received 1045 citations till now. The article focuses on the topics: Combinatorial auction & Common value auction.read more
Citations
More filters
Book ChapterDOI
Agent- Based Intelligent Media Distribution in Advertisement
TL;DR: The overall goal of this work is to provide an intelligent media-content distribution, by which business intelligence is utilized to strengthen the business-customer relationships and increase profitability.
Journal ArticleDOI
A Combinatorial Auction Based Algorithm for Flexible Seat Reservation Systems
Kazutoshi Otomura,Norio Tomii +1 more
TL;DR: Three kinds of such algorithms for the seat distribution problem are presented together with the results of several experiments, suggesting that in order to get solutions with high quality, algorithms that appropriately control the search space are indispensable.
Posted Content
Strategic Bidding in Product-Mix, Sequential, and Simultaneous Auctions
TL;DR: In this paper, a flexible bidder with unit demand, interested in buying any of the goods, competes against several inflexible bidders, each interested in only one specific good.
Modelling and solving of multidimensional auctions
TL;DR: The proposed model, called multidimensional auction, is a generaliz tion of an LP model of standard single item English auction, which illustrates the possibility to formulate and solve multiddimensional auctions as mathematical programming problems.
References
More filters
Book
Introduction to Algorithms
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
Book ChapterDOI
Reducibility Among Combinatorial Problems
TL;DR: The work of Dantzig, Fulkerson, Hoffman, Edmonds, Lawler and other pioneers on network flows, matching and matroids acquainted me with the elegant and efficient algorithms that were sometimes possible.
Book
Integer programming
TL;DR: The principles of integer programming are directed toward finding solutions to problems from the fields of economic planning, engineering design, and combinatorial optimization as mentioned in this paper, which is a standard of graduate-level courses since 1972.
Journal ArticleDOI
Incentives in Teams
TL;DR: This paper analyzes the problem of inducing the members of an organization to behave as if they formed a team and exhibits a particular set of compensation rules, an optimal incentive structure, that leads to team behavior.