Abstract
Myerson's graph-restricted games are a well-known formalism for modeling cooperation that's subject to restrictions. In particular, Myerson considered a coalitional game in which cooperation is possible only through an underlying network of links between agents. A unique fair solution concept for graph-restricted games is called the Myerson value. One study generalized these results by considering probabilistic graphs in which agents can cooperate via links only to some extent, that is, with some probability. The authors' algorithm is based on the enumeration of all connected subgraphs in the graph. As a sample application of the new algorithm, they consider a probabilistic graph that represents likelihood of pairwise collaboration between political parties before the 2015 general elections in the UK.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
