The positional power of nodes in digraphs
DOI10.1007/S00355-003-0308-9zbMATH Open1088.90505OpenAlexW2089696400MaRDI QIDQ2575412FDOQ2575412
Dolf Talman, P. Jean-Jacques Herings, Gerard van der Laan
Publication date: 9 December 2005
Published in: Social Choice and Welfare (Search for Journal in Brave)
Full work available at URL: https://cris.maastrichtuniversity.nl/en/publications/c5bcb9e5-de7c-4998-9321-25fefce23ded
Recommendations
Applications of graph theory (05C90) Social choice (91B14) Directed graphs (digraphs), tournaments (05C20) Deterministic network models in operations research (90B10)
Cited In (18)
- Axiomatizations of the \(\beta\) and the score measures in networks
- A Shapley measure of power in hierarchies
- Axioms for centrality scoring with principal eigenvectors
- From hierarchies to levels: new solutions for games with hierarchical structure
- The probabilistic Harsanyi power solutions for probabilistic graph games
- Development of hierarchy theory for digraphs using concentration theory based on a new type of Lorenz curve
- Ranking by relational power based on digraphs
- Power measures and solutions for games under precedence constraints
- A graph interpretation of the least squares ranking method
- Accessibility measures to nodes of directed graphs using solutions for generalized cooperative games
- On incentive compatible competitive selection protocols
- Scoring of web pages and tournaments-axiomatizations
- Paired comparisons analysis: an axiomatic approach to ranking methods
- Harsanyi power solutions for graph-restricted games
- Socially structured games
- On Different Ranking Methods
- Networks, Information and Choice
- Indirect control and power in mutual control structures
This page was built for publication: The positional power of nodes in digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2575412)
