An Integer Partition Based Algorithm for Coalition Structure Generation

Aizu-Wakamatsu City, Fukushima, Japan October 16-October 19

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/CIT.2007.157

7th IEEE International Conference on ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Veera Boonjing Articles by Santit Narabin

	ASCII Text	x
	Veera Boonjing, Santit Narabin, "An Integer Partition Based Algorithm for Coalition Structure Generation," Computer and Information Technology, International Conference on, pp. 312-315, 7th IEEE International Conference on Computer and Information Technology (CIT 2007), 2007.

	BibTex	x
	@article{ 10.1109/CIT.2007.157, author = {Veera Boonjing and Santit Narabin}, title = {An Integer Partition Based Algorithm for Coalition Structure Generation}, journal ={Computer and Information Technology, International Conference on}, volume = {0}, year = {2007}, isbn = {0-7695-2983-6}, pages = {312-315}, doi = {http://doi.ieeecomputersociety.org/10.1109/CIT.2007.157}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Computer and Information Technology, International Conference on TI - An Integer Partition Based Algorithm for Coalition Structure Generation SN - 0-7695-2983-6 SP312 EP315 A1 - Veera Boonjing, A1 - Santit Narabin, PY - 2007 VL - 0 JA - Computer and Information Technology, International Conference on ER -

Veera Boonjing, King Mongkut?s Institute of Technology Ladkrabang, Bangkok 10520, Thailand

Santit Narabin, King Mongkut?s Institute of Technology Ladkrabang, Bangkok 10520, Thailand

This paper proposes a new algorithm to generate a minimal search space of the problem of coalition structure generation using a new optimal integer partition. The new partition includes only partitions giving optimal coalition structures. These partitions are those containing 1 at most one element. Our new algorithm generates optimal partition structures in two steps. The first step, we use a modified version of ZS1 algorithm to generate the optimal integer partition of input integer. We then use the partition to generate optimal coalition structures in the second step.

Citation:

Veera Boonjing, Santit Narabin, "An Integer Partition Based Algorithm for Coalition Structure Generation," cit, pp.312-315, 7th IEEE International Conference on Computer and Information Technology (CIT 2007), 2007

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.