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
Posted Content
A Fast Graph Neural Network-Based Method for Winner Determination in Multi-Unit Combinatorial Auctions
TL;DR: This work model the multi-unit WDP as an augmented bipartite bid-item graph and use a graph neural network with half-convolution operations to learn the probability of each bid belonging to the optimal allocation, and develops two novel graph-based post-processing algorithms to transform the outputs of the GNN into feasible solutions.
Journal ArticleDOI
Data dependent worst case bounds for weighted set packing
TL;DR: By using an argument based on linear programming duality a priori bounds that are a function of the minimum guaranteed weight quantities, the highest average reward for a ground item, and cardinality of the ground set are developed.
Journal ArticleDOI
Coordination of Purchasing and Bidding Activities Across Posted Offer and Auction Markets
TL;DR: This paper presents two sets of models related to a new approach to deal with the combinatorial interdependency challenges for online markets that uses trading agents to coordinate a buyer’s purchasing and bidding activities across multiple online markets simultaneously to achieve the best overall procurement effectiveness.
Book ChapterDOI
Best-First AND/OR Search for 0/1 Integer Programming
Radu Marinescu,Rina Dechter +1 more
TL;DR: The effectiveness of the best-first And/OR search approach compared to depth-first AND/OR Branch-and-Bound search is demonstrated on a variety of benchmarks for 0/1 ILPs, including instances from the MIPLIB library, real-world combinatorial auctions, random uncapacitated warehouse location problems and MAX-SAT instances.
Multi-option descending clock auction
Tri-Dung Nguyen,Tuomas Sandholm +1 more
TL;DR: A Markov chain model for representing the dynamics of each bidder’s state, as well as an optimization model and technique for finding prices to offer to the different bidders for the different options in each round of a descending clock auction, are developed.
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.