Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Computationally Manageable Combinational Auctions
Management Science
Flexible double auctions for electionic commerce: theory and implementation
Decision Support Systems - Special issue on economics of electronic commerce
A fast algorithm for strongly correlated knapsack problems
Discrete Applied Mathematics
Bidding and allocation in combinatorial auctions
Proceedings of the 2nd ACM conference on Electronic commerce
Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics
Proceedings of the 2nd ACM conference on Electronic commerce
Towards a universal test suite for combinatorial auction algorithms
Proceedings of the 2nd ACM conference on Electronic commerce
Computationally feasible VCG mechanisms
Proceedings of the 2nd ACM conference on Electronic commerce
Combinatorial auctions with decreasing marginal utilities
Proceedings of the 3rd ACM conference on Electronic Commerce
Algorithm for optimal winner determination in combinatorial auctions
Artificial Intelligence
Winner determination in combinatorial auction generalizations
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
Caching in multi-unit combinatorial auctions
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Truth revelation in approximately efficient combinatorial auctions
Journal of the ACM (JACM)
Tractable combinatorial auctions and b-matching
Artificial Intelligence
An Algorithm for Multi-Unit Combinatorial Auctions
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Some Tractable Combinatorial Auctions
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Combinatorial Auctions, Knapsack Problems, and Hill-Climbing Search
AI '01 Proceedings of the 14th Biennial Conference of the Canadian Society on Computational Studies of Intelligence: Advances in Artificial Intelligence
Efficient Winner Determination Techniques for Internet Multi-Unit Auctions
I3E '01 Proceedings of the IFIP Conference on Towards The E-Society: E-Commerce, E-Business, E-Government
Approximately-strategyproof and tractable multi-unit auctions
Proceedings of the 4th ACM conference on Electronic commerce
Towards a Characterization of Truthful Combinatorial Auctions
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Combinatorial Auctions: A Survey
INFORMS Journal on Computing
Management Science
Resource allocation in competitive multiagent systems
Resource allocation in competitive multiagent systems
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Generating k-best solutions to auction winner determination problems
ACM SIGecom Exchanges
VTDC '06 Proceedings of the 2nd International Workshop on Virtualization Technology in Distributed Computing
Efficiently Generating k-Best Solutions to Procurement Auctions
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Review: Improving urban wastewater management through an auction-based management of discharges
Environmental Modelling & Software
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
Mobile online gaming via resource sharing
Proceedings of the 5th International ICST Conference on Simulation Tools and Techniques
Hi-index | 0.00 |
The problem of allocating discrete computational resources motivates interest in general multi-unit combinatorial exchanges. This paper considers the problem of computing optimal (surplus-maximizing) allocations, assuming unrestricted quasi-linear preferences. We present a solver whose pseudo-polynomial time and memory requirements are linear in three of four natural measures of problem size: number of agents, length of bids, and units of each resource. In applications where the number of resource types is inherently a small constant, e.g., computational resource allocation, such a solver offers advantages over more elaborate approaches developed for high-dimensional problems. We also describe the deep connection between auction winner determination problems and generalized knapsack problems, which has received remarkably little attention in the literature. This connection leads directly to pseudo-polynomial solvers, informs solver benchmarking by exploiting extensive research on hard knapsack problems, and allows E-Commerce research to leverage a large and mature body of literature.