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
Journal ArticleDOI
Average-case analysis of best-first search in two representative directed acyclic graphs
TL;DR: The theoretical results reflect on the long-standing debate on the expected complexity of branch-and-bound algorithms for solving the Traveling Salesman Problem, indicating that the complexity can be polynomial or exponential, depending on the accuracy of the heuristic function used.
Journal ArticleDOI
Overlapping coalition formation in game theory: A state-of-the-art review
TL;DR: A review of coalition structure generation at large is provided to develop a taxonomic framework and classify the existing literature and micro analysis is reviewed thoroughly, viz., macro analysis.
Book ChapterDOI
MAGNET: A Multi-Agent System using Auctions with Temporal and Precedence Constraints
John Collins,Maria Gini +1 more
TL;DR: A winner determination method is explored, which is an extension of the bidtree-based Iterative-Deepening A* (IDA*) formulation proposed by Sandholm, which addresses the problem of rational, self-interested, eco- nomic agents who must negotiate with each other in order to carry out their plans.
Proceedings ArticleDOI
Solving Combinatorial Exchanges: Optimality via a Few Partial Bids
TL;DR: A combinatorial exchange is an exchange where buyers and sellers can bid on bundles (subsets) of goods as discussed by the authors, which is a generalization of the traditional auction mechanism.
Adaptive Decision Support for Academic Course Scheduling Using Intelligent Software Agents
TL;DR: This paper addresses academic course scheduling as a dynamic decision support problem using an agentenabled adaptive decision support system and illustrates an application of the IAEDS system where agents are used to make complex scheduling decisions in a dynamically changing environment.
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.