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
Multi-unit combinatorial reverse auctions with transformability relationships among goods
TL;DR: In this paper, the authors extend the notion of multi-unit combinatorial reverse auction by adding a new dimension to the goods at auction, which allows a buyer to express transformability relationships among goods: some goods can be transformed into others at a transformation cost.
Book ChapterDOI
AND/OR branch-and-bound search for pure 0/1 integer linear programming problems
Radu Marinescu,Rina Dechter +1 more
TL;DR: This paper introduces a new dynamic AND/OR Branch-and-Bound algorithm able to accommodate variable ordering heuristics and demonstrates the effectiveness of the dynamic And/OR approach on a variety of benchmarks for pure 0/1 integer programming.
Journal ArticleDOI
Maximizing welfare through cooperative negotiation in a multi-agent Internet economy
TL;DR: This work investigates markets for goods that are characterized by an experience-limited supply curve and proposes an algorithm that maximizes the welfare in the e-market by maximizing the combined profit of the buyers and sellers.
Proceedings ArticleDOI
Enabling Privacy-preserving Auctions in Big Data
Taeho Jung,Xiang-Yang Li +1 more
TL;DR: Wang et al. as mentioned in this paper proposed a privacy-preserving construction for auction mechanism design in the big data, which prevents adversaries from learning unnecessary information except those implied in the valid output of the auction.
Book ChapterDOI
Combinatorial auction with minimal resource requirements
TL;DR: This paper considers a combinatorial auction problem in which an auctioneer wants to acquire resources from a set of bidders to process the tasks on hand, and develops a problem formulation and solution methodology based on Lagrangian relaxation.
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.