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
A unified comparative study of heuristic algorithms for double combinatorial auctions: Locality-constrained resource allocation problems
TL;DR: It is posited that a unifying approach for evaluating all existing algorithms, under the umbrella of a consistent problem formulation and a variety of common test cases, can propel combinatorial auctions towards real-world usage.
Doctoral Mentoring Program AAMAS 2009 Eighth International Conference on Autonomous Agents and Multi-Agent Systems
TL;DR: AAMAS 2009 included a doctoral mentoring program intended for PhD students in advanced stages of their research, which provided an opportunity for students to interact closely with established researchers in their fields, to receive feedback on their work and to get advice on managing their careers as discussed by the authors.
Proceedings ArticleDOI
Comparison of Two Differential Evolution Approaches for Combinatorial Double Auctions
TL;DR: In this article, the effectiveness of applying two differential evolution based algorithms to solve the winner determination problem in combinatorial double auctions was studied, and the results showed that the two algorithms can be compared by conduct several experiments.
Journal ArticleDOI
A Bayesian optimal social law synthesizing mechanism for strategical agents
TL;DR: This paper tries to specify Computation Tree Logic semantics as a set of linear-integer constraints, design a Integer-Linear Programming based algorithm for computing the proposed mechanism, enabling it to be handled by current ILP solvers, and finally finds out a tractable 2-approximation mechanism.
Proceedings ArticleDOI
Sub-game perfect Nash equilibrium under loser reporting
Wei Huang,Chao Huang +1 more
TL;DR: In this article , the authors study the loser reporting policy in parallel allocation, which ensures that the difference between the number of items taken by the agents does not exceed one, in order to maximize the interests of self-interested agents while taking into account fairness.
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.