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
La maximisation du bien-être utilitaire des sociétés d'agents
TL;DR: In this paper, the authors consider the resource allocation problem within an entity set and study various agent behaviors in order to identify which one leads to the optimal resource allocation required, thanks to an emergent phenomenon.
Journal ArticleDOI
A Market-Inspired Approach for Intersection Management in Urban Road Traffic Networks
Matteo Vasirani,Sascha Ossowski +1 more
TL;DR: In this article, a distributed market-inspired mechanism for the management of a future urban road network, where intelligent autonomous vehicles, operated by software agents on behalf of their human owners, interact with the infrastructure in order to travel safely and efficiently through the road network.
Proceedings ArticleDOI
Truthful Virtual Machine Allocation in Clouds Based on LP-relaxation
TL;DR: A truthful auction-based scheme to allocate virtual machine (VM) instances of various types to the users in clouds so that the total amount of valuations attained by the allocation is maximized.
Posted Content
Walrasian Equilibria in Markets with Small Demands
TL;DR: This work gives the first parallel algorithm that finds a Walrasian equilibrium in polylogarithmic time, and gives a polynomial-time algorithm for markets with 2-demand single-minded valuations, or unit-demand valuations.
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.