RESEARCH COMMONS
LIBRARY

A Value for Digraph-restricted Games

ResearchCommons/Manakin Repository

A Value for Digraph-restricted Games

Show simple item record

dc.contributor.author Voshtina, Oltion en
dc.date.accessioned 2010-06-03T18:08:06Z en
dc.date.available 2010-06-03T18:08:06Z en
dc.date.issued 1997 en
dc.identifier.uri http://hdl.handle.net/10106/2328 en
dc.description.abstract Digraph-restricted games model situations where some of the players, due to the lack of communication among them, are unable to cooperate. A digraph-restricted game v is defined as a function from the set of feasible coalitions to the reals. By strengthening the symmetry axiom we obtain an extension of the Shapley value for this class of games. Key words. Shapley value, cooperative game, directed graph. en
dc.language.iso en_US en
dc.publisher University of Texas at Arlington en
dc.relation.ispartofseries Technical Report;329 en
dc.subject Shapley value en
dc.subject Cooperative game en
dc.subject Directed graphic en
dc.subject.lcsh Game theory en
dc.subject.lcsh Mathematics Research en
dc.title A Value for Digraph-restricted Games en
dc.type Technical Report en
dc.publisher.department Department of Mathematics en

Files in this item

Files Size Format View Description
MathTechReport329.pdf 724.4Kb PDF View/Open PDF

This item appears in the following Collection(s)

Show simple item record

Browse

My Account

Statistics

About Us