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
Proceedings ArticleDOI
On-line adapting games using agent organizations
TL;DR: This work suggests a multi-agent approach for adapting serious games to the skill level of the trainee using separate agents to guarantee the natural progression of each element of the game and thus its believability.
Journal ArticleDOI
A mixed procurement model for humanitarian relief chains
Mojtaba Aghajani,S. Ali Torabi +1 more
TL;DR: A novel two-round decision model is developed to capture the dynamic nature of the relief procurement process by allowing demand updating and a novel reverse auction framework for relief procurement in the form of a multi-attribute combinatorial auction is proposed.
Journal ArticleDOI
Argumentation-based negotiation for collaborative engineering design
Yan Jin,Mathieu Geslin +1 more
TL;DR: An argumentation based engineering negotiation approach is proposed that provides a structured framework for designers to specify design situations, compose arguments, and make joint decisions by following various strategies.
Resource Allocation in Computational Grids - A Market Engineering Approach
TL;DR: The design of a market for allocating and scheduling resources in Computational Grids is outlined, based on the Market Engineering process, which provides methods and design principles for the development of market institutions.
Journal ArticleDOI
An experimental analysis of biased parallel greedy approximation for combinatorial auctions
Naoki Fukuta,Takayuki Ito +1 more
TL;DR: An analysis about performance issues of biased parallel greedy updating approach in various experimental settings is shown and it is shown that the algorithm has a certain advantage to solve a kind of large-size high-complexity problems when it is compared to a latest commercial-level implementation of generic LP solver through various experiments.
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.