Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.11861/6438
DC FieldValueLanguage
dc.contributor.authorProf. YEUNG Wing Kay, Daviden_US
dc.contributor.authorKu, Eric L. H.en_US
dc.contributor.authorYeung, Patricia M.en_US
dc.date.accessioned2021-02-25T11:55:34Z-
dc.date.available2021-02-25T11:55:34Z-
dc.date.issued2008-
dc.identifier.citationInternational Journal of Algebra, 2008, vol. 2(4), pp. 181-185.en_US
dc.identifier.issn1314-7595-
dc.identifier.issn1312-8868-
dc.identifier.urihttp://hdl.handle.net/20.500.11861/6438-
dc.description.abstractCooperative 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.isoenen_US
dc.relation.ispartofInternational Journal of Algebraen_US
dc.titleA recursive sequence for the number of positioned partitionsen_US
dc.typePeer Reviewed Journal Articleen_US
item.fulltextNo Fulltext-
crisitem.author.deptDepartment of Economics and Finance-
Appears in Collections:Economics and Finance - Publication
Show simple item record

Page view(s)

35
checked on Jan 3, 2024

Google ScholarTM

Impact Indices

PlumX

Metrics


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.