A Randomized Maximum-Flow Algorithm
SIAM Journal on Computing
An o(n^3)-Time Algorithm Maximun-Flow Algorithm
SIAM Journal on Computing
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Cooperative Strategies for Solving the Bicriteria Sparse Multiple Knapsack Problem
Journal of Heuristics
An Algorithm for Optimal Winner Determination in Combinatorial Auctions
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Approximately-strategyproof and tractable multi-unit auctions
Proceedings of the 4th ACM conference on Electronic commerce
Approximately-strategyproof and tractable multiunit auctions
Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce
Used car salesman problem: A differential auction--barter market
Annals of Mathematics and Artificial Intelligence
Bid expressiveness and clearing algorithms in multiattribute double auctions
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Resource bartering in data grids
Scientific Programming
Bin completion algorithms for multicontainer packing, knapsack, and covering problems
Journal of Artificial Intelligence Research
Making markets and democracy work: a story of incentives and computing
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Achieving budget-balance with Vickrey-based payment schemes in exchanges
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Combining multiple representations in a genetic algorithm for the multiple Knapsack problem
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Approximately-strategyproof and tractable multiunit auctions
Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce
A framework of winner determination algorithms for internet auctions
HSI'03 Proceedings of the 2nd international conference on Human.society@internet
Integrating symmetry, dominance, and bound-and-bound in a multiple knapsack solver
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Testing continuous double auctions with a constraint-based oracle
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Multi-unit differential auction-barter model for electronic marketplaces
Electronic Commerce Research and Applications
Interval subset sum and uniform-price auction clearing
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Storage exchange: a global trading platform for storage services
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Market-based allocation with indivisible bids
AMEC'05 Proceedings of the 2005 international conference on Agent-Mediated Electronic Commerce: designing Trading Agents and Mechanisms
Improved multi-unit auction clearing algorithms with interval (multiple-choice) knapsack problems
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Hi-index | 0.00 |
We investigate the computational complexity of clearing markets in a continuous call double auction. In the simplest case, when any part of any bid can be matched with any part of any ask, the market can be cleared optimally in log-linear time. We present two generalizations, motivated by electronic marketplaces for the process industry, where: (a) there exist assignment constraints on which bids can be matched with which asks, and (b) where demand is indivisible. We show that clearing markets with assignment constraints can be solved efficiently using network flow algorithms. However clearing markets with indivisible demand, with or without assignment constraints, requires solving NP-hard optimization problems such as the generalized assignment problem, the multiple knapsack problem and the bin packing problem.