A hybrid exact algorithm for complete set partitioning
From MaRDI portal
Publication:901033
DOI10.1016/j.artint.2015.09.006zbMath1344.68271OpenAlexW2128510237MaRDI QIDQ901033
Talal Rahwan, Nicholas R. Jennings, Michael Wooldridge, Edith Elkind, Tomasz P. Michalak
Publication date: 23 December 2015
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/382335/1/1-s2.0-S0004370215001423-main.pdf
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Noncooperative games (91A10) Combinatorial optimization (90C27) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items (2)
On the complete set packing and set partitioning polytopes: properties and rank 1 facets ⋮ Improved WPM encoding for coalition structure generation under MC-nets
Cites Work
- Computing cooperative solution concepts in coalitional skill games
- An algorithm for distributing coalitional value calculations among cooperating agents
- An efficient algorithm for the complete set partitioning problem
- A dynamic programming approach to the complete set partitioning problem
- Methods for task allocation via agent coalition formation
- Coalition structure generation with worst case guarantees
- Anytime coalition structure generation in multi-agent systems with positive or negative externalities
- Computationally Manageable Combinational Auctions
- Set Partitioning via Inclusion-Exclusion
- Graphs and Cooperation in Games
- Exponential Numbers
- Anytime coalition structure generation: an average case study
- The Set-Partitioning Problem: Set Covering with Equality Constraints
- Algorithm for optimal winner determination in combinatorial auctions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A hybrid exact algorithm for complete set partitioning
