Combinatorial auctions, an example of algorithm theory in real life

Authors:
Arne Andersson
Affiliations:
Computing Science Department, Information Technology, Uppsala University, Box 337, SE - 751 05 Uppsala, Sweden
Venue:
Computer Science in Perspective
Year:
2003

Citing 7
Cited 0

Binary search trees of almost optimal height

Acta Informatica
Computationally Manageable Combinational Auctions

Management Science
iBundle: an efficient ascending price bundle auction

Proceedings of the 1st ACM conference on Electronic commerce
Caching in multi-unit combinatorial auctions

Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
An Algorithm for Optimal Winner Determination in Combinatorial Auctions

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Market structure and multidimensional auction design for computational economies

Market structure and multidimensional auction design for computational economies

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this article, we discuss combinatorial auctions, an interesting interdisciplinary research field in Computer Science and Economics. In particular, we will (a) describe a set of real-world cases, (b) how to solve the associated computational problems, and (c) discuss the impact of the probability distributions chosen for benchmarking.