A recursive sequence for the number of positioned partitions

Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.11861/6438

DC Field	Value	Language
dc.contributor.author	Prof. YEUNG Wing Kay, David	en_US
dc.contributor.author	Ku, Eric L. H.	en_US
dc.contributor.author	Yeung, Patricia M.	en_US
dc.date.accessioned	2021-02-25T11:55:34Z	-
dc.date.available	2021-02-25T11:55:34Z	-
dc.date.issued	2008	-
dc.identifier.citation	International Journal of Algebra, 2008, vol. 2(4), pp. 181-185.	en_US
dc.identifier.issn	1314-7595	-
dc.identifier.issn	1312-8868	-
dc.identifier.uri	http://hdl.handle.net/20.500.11861/6438	-
dc.description.abstract	Cooperative games are frequently formulated in terms of partition functions. In particular, the set of players may be divided into various coalitions forming partitions with different coalition structures. This paper derives a recursive sequence identifying the number of partitions in an-player game where the position of the individual player counts.	en_US
dc.language.iso	en	en_US
dc.relation.ispartof	International Journal of Algebra	en_US
dc.title	A recursive sequence for the number of positioned partitions	en_US
dc.type	Peer Reviewed Journal Article	en_US
crisitem.author.dept	Department of Economics and Finance	-
item.fulltext	No Fulltext	-
Appears in Collections:	Economics and Finance - Publication

Find@HKSYU

55

Last Week
0

Last month

checked on Feb 19, 2025

Impact Indices