Accessibility measures to nodes of directed graphs using solutions for generalized cooperative games (Q1935924)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6137592
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Accessibility measures to nodes of directed graphs using solutions for generalized cooperative games |
scientific article; zbMATH DE number 6137592 |
Statements
Accessibility measures to nodes of directed graphs using solutions for generalized cooperative games (English)
0 references
20 February 2013
0 references
Using methods of cooperative game theory, accessibility measures for the nodes of directed graphs are constructed. Since digraphs without a predefined game are considered, the main part of the paper is devoted to establishing conditions on cooperative games that make it possible to measure accessibility. Games that satisfy desirable properties are called test games. Each ranking on the nodes is then obtained according to a pair formed by a test game and a solution defined on cooperative games whose utilities are given for ordered coalitions. The solutions proposed are extensions of the wide family of semivalues to games in generalized characteristic function form.
0 references
cooperative game
0 references
digraph
0 references
accessibility
0 references
semivalue
0 references
0.866681694984436
0 references
0.7950689792633057
0 references
0.7828118205070496
0 references
0.7801353335380554
0 references
0.7647991180419922
0 references
