Anytime coalition structure generation: an average case study

DOI10.1080/095281300146290zbMath1033.68840OpenAlexW2033201011MaRDI QIDQ4779480

Tuomas W. Sandholm, Kate Larson

Publication date: 27 November 2002

Published in: Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/095281300146290

zbMATH Keywords

multiagent systemscoalition formation

Mathematics Subject Classification ID

Computing methodologies and applications (68U99)

Related Items (6)

A column generation approach to the coalition formation problem in multi-agent systems ⋮ A hybrid exact algorithm for complete set partitioning ⋮ Complexity of constructing solutions in the core based on synergies among coalitions ⋮ Anytime coalition structure generation in multi-agent systems with positive or negative externalities ⋮ Cooperative games with overlapping coalitions: charting the tractability frontier ⋮ Anytime coalition structure generation: an average case study

Cites Work

• Coalition-proof Nash equilibria. I: Concepts
• Methods for task allocation via agent coalition formation
• Coalitional bargaining with competition to make offers
• Coalitions among computationally bounded agents
• Coalition structure generation with worst case guarantees
• The Nakamura theorem for coalition structures of quota games
• A noncooperative coalitional bargaining game with random proposers
• Computationally Manageable Combinational Auctions
• Perfect Equilibrium in a Bargaining Model
• A Dynamic Theory for the Class of Games with Nonempty Cores
• Anytime coalition structure generation: an average case study
• Coalition formation processes with belief revision among bounded-rational self-interested agents
• A Noncooperative Theory of Coalitional Bargaining

This page was built for publication: Anytime coalition structure generation: an average case study