Computationally Manageable Combinational Auctions
Management Science
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
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
A logic programming approach to knowledge-state planning, II: the DLVk system
Artificial Intelligence
Solving combinatorial exchanges: optimality via a few partial bids
Proceedings of the 4th ACM conference on Electronic commerce
Constraint Processing
Algorithm Design
On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition
Proceedings of the 8th ACM conference on Electronic commerce
DECLARE: Full Support for Loosely-Structured Processes
EDOC '07 Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference
Winner determination for mixed multi-unit combinatorial auctions via petri nets
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
A survey on web services composition
International Journal of Web and Grid Services
Computationally-efficient winner determination for mixed multi-unit combinatorial auctions
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Comparing winner determination algorithms for mixed multi-unit combinatorial auctions
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
A test suite for the evaluation of mixed multi-unit combinatorial auctions
Journal of Algorithms
A mixed multi-unit combinatorial auctions test suite
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Synthesis and Composition of Web Services
Formal Methods for Web Services
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
Bidding languages and winner determination for mixed multi-unit combinatorial auctions
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Charting the tractability frontier of mixed multi-unit combinatorial auctions
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A graphical formalism for mixed multi-unit combinatorial auctions
Autonomous Agents and Multi-Agent Systems
Time constraints in mixed multi-unit combinatorial auctions
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Empirical hardness for mixed auctions
CAEPIA'09 Proceedings of the Current topics in artificial intelligence, and 13th conference on Spanish association for artificial intelligence
Structural tractability of constraint optimization
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Decomposing combinatorial auctions and set packing problems
Journal of the ACM (JACM)
| Hi-index | 0.00 |
Mixed multi-unit combinatorial auctions (MMUCAs) are extensions of classical combinatorial auctions (CAs) where bidders trade transformations of goods rather than just sets of goods. Solving MMUCAs, i.e., determining the sequences of bids to be accepted by the auctioneer, is computationally intractable in general. However, differently from classical combinatorial auctions, little was known about whether polynomial-time solvable classes of MMUCAs can be singled out on the basis of their characteristics. The paper fills this gap, by studying the computational complexity of MMUCA instances under structural and qualitative restrictions, which characterize interactions among bidders and types of bids involved in the various transformations, respectively.