A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
Maximum independent sets on transitive graphs and their applications in testing and CAD
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Computationally Manageable Combinational Auctions
Management Science
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
Degrees of acyclicity for hypergraphs and relational database schemes
Journal of the ACM (JACM)
Bidding and allocation in combinatorial auctions
Proceedings of the 2nd ACM conference on Electronic commerce
A comparison of structural CSP decomposition methods
Artificial Intelligence
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
An efficient approximate allocation algorithm for combinatorial auctions
Proceedings of the 3rd ACM conference on Electronic Commerce
Algorithm for optimal winner determination in combinatorial auctions
Artificial Intelligence
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
Conjunctive Query Containment Revisited
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Combinatorial Approaches to Finding Subtle Signals in DNA Sequences
Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology
Treewidth: Algorithmoc Techniques and Results
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Hypertree Decompositions: A Survey
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Independent Sets in Hypergraphs with Applications to Routing via Fixed Paths
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Solving Combinatorial Auctions Using Stochastic Local Search
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
An Optimisation Algorithm for Maximum Independent Set with Applications in Map Labelling
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Solving concisely expressed combinatorial auction problems
Eighteenth national conference on Artificial intelligence
BOB: improved winner determination in combinatorial auctions and generalizations
Artificial Intelligence
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
Journal of Computer and System Sciences - Special issu on PODS 2001
Constraint Processing
A Combinatorial Auction with Multiple Winners for Universal Service
Management Science
Combinatorial Auctions
Allocation of indivisible goods: a general model and some complexity results
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Truthful and Near-Optimal Mechanism Design via Linear Programming
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Constraint solving via fractional edge covers
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Truthful randomized mechanisms for combinatorial auctions
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Computing pure nash equilibria in graphical games via markov random fields
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
The L(h, k)-Labelling Problem: A Survey and Annotated Bibliography
The Computer Journal
Weighted hypertree decompositions and optimal query plans
Journal of Computer and System Sciences
Algorithms for acyclic database schemes
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
A unified theory of structural tractability for constraint satisfaction problems
Journal of Computer and System Sciences
Properties of tree convex constraints
Artificial Intelligence
Undirected connectivity in log-space
Journal of the ACM (JACM)
Improved Approximation Algorithms for Minimum Weight Vertex Separators
SIAM Journal on Computing
Exact Algorithms for Treewidth and Minimum Fill-In
SIAM Journal on Computing
A backtracking-based algorithm for hypertree decomposition
Journal of Experimental Algorithmics (JEA)
Treewidth Computation and Extremal Combinatorics
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Hypertree Decompositions for Combinatorial Auctions: Optimal Winner Determination
Hypertree Decompositions for Combinatorial Auctions: Optimal Winner Determination
Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations
Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations
Uniform Constraint Satisfaction Problems and Database Theory
Complexity of Constraints
Tractable Optimization Problems through Hypergraph-Based Structural Restrictions
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Combinatorial auctions with structured item graphs
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Simple randomized algorithms for tractable row and tree convex constraints
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Weighted super solutions for constraint programs
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Pure Nash equilibria: hard and easy games
Journal of Artificial Intelligence Research
Computationally feasible VCG mechanisms
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Taming the computational complexity of combinatorial auctions: optimal and approximate approaches
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Bidding languages and winner determination for mixed multi-unit combinatorial auctions
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Approximation Algorithms for Treewidth
Algorithmica
On the power of structural decompositions of graph-based representations of constraint problems
Artificial Intelligence
Maximizing revenue in sequential auctions
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Incremental routing and scheduling in wireless grids
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
An implementation of the contract net protocol based on marginal cost calculations
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Routing Trains Through Railway Junctions: A New Set-Packing Approach
Transportation Science
Structural tractability of constraint optimization
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
H-DB: a hybrid quantitative-structural sql optimizer
Proceedings of the 20th ACM international conference on Information and knowledge management
Incrementally computing ordered answers of acyclic conjunctive queries
NGITS'06 Proceedings of the 6th international conference on Next Generation Information Technologies and Systems
Multiobject tracking as maximum weight independent set
CVPR '11 Proceedings of the 2011 IEEE Conference on Computer Vision and Pattern Recognition
Constraint optimization problems and bounded tree-width revisited
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Combinatorial Optimization on Graphs of Bounded Treewidth
The Computer Journal
Hi-index | 0.00 |
Combinatorial auctions allow bidders to bid on bundles of items rather than just on single items. The winner determination problem in combinatorial auctions is the problem of determining the allocation of items to bidders such that the sum of the accepted bid prices is maximized. This problem is equivalent to the well-known maximum-weight set packing problem. Even though these problems are NP-hard in general, they can be solved in polynomial time on instances whose associated item graphs have bounded treewidth (called structured item graphs). However, the tractability of determining whether for a given problem instance a structured item graph of fixed treewidth exists (and if so, computing one efficiently) was an open problem. In this article, we solve this problem by proving that deciding the existence of structured item graphs is computationally intractable, even for treewidth 3. Motivated by this unfavorable complexity result, we investigate other structural restrictions, and we show that the notion of hypertree decomposition, a well-studied measure of hypergraph cyclicity, turns out to be most useful here. Indeed, we show that the winner determination problem is solvable in polynomial time on instances whose dual auction hypergraphs have bounded hypertree width. Our solution method is based on encoding winner determination via a constraint satisfaction optimization problem and on exhibiting an algorithm to solve this latter problem efficiently for such structurally restricted instances. The class of tractable instances identified by our approach, while being efficiently recognizable, properly contains the class of instances having a structured item graph. Moreover, on the larger class, our method solves winner determination with the same asymptotic complexity as the best algorithm proposed in the literature for the subclass of structured item graphs. Hypertree decompositions can equally profitably be applied to the maximum-weight independent set problem, which is the dual problem of maximum-weight set packing.