Computational Model Library

Heuristic Algorithm for Generating Strategic Coalition Structures (1.0.0)

The purpose of the model is to generate coalition structures of different glove games, using a specially designed algorithm. The coalition structures can be are later analyzed by comparing them to core partitions of the game used. Core partitions are coalition structures where no subset of players has an incentive to form a new coalition.

The algorithm used in this model is an advancement of the algorithm found in Collins & Frydenlund (2018). It was used used to generate the results in Vernon-Bido & Collins (2021).

PAPER DANIELE round flow 100620.jpg

Release Notes

Initial Release

Associated Publications

Vernon-Bido, Daniele and Collins, Andrew (2021) ‘Finding Core Members of Cooperative Games Using Agent-Based Modeling’ Journal of Artificial Societies and Social Simulation 24 (1) 6 http://jasss.soc.surrey.ac.uk/24/1/6.html. doi: 10.18564/jasss.4457

Collins, A. J., & Frydenlund, E. (2018). Strategic Group Formation in Agent-based Simulation. Simulation, 94(3), 179-193.

Heuristic Algorithm for Generating Strategic Coalition Structures 1.0.0

The purpose of the model is to generate coalition structures of different glove games, using a specially designed algorithm. The coalition structures can be are later analyzed by comparing them to core partitions of the game used. Core partitions are coalition structures where no subset of players has an incentive to form a new coalition.

The algorithm used in this model is an advancement of the algorithm found in Collins & Frydenlund (2018). It was used used to generate the results in Vernon-Bido & Collins (2021).

Release Notes

Initial Release

Version Submitter First published Last modified Status
1.0.0 Andrew Collins Mon Oct 12 20:16:28 2020 Mon Jan 11 18:15:29 2021 Published

Discussion

This website uses cookies and Google Analytics to help us track user engagement and improve our site. If you'd like to know more information about what data we collect and why, please see our data privacy policy. If you continue to use this site, you consent to our use of cookies.
Accept